Well-indumatched Trees and Graphs of Bounded Girth

03/07/2019
by   S. Akbari, et al.
0

A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time algorithm to decide if a tree is well-indumatched or not. Then, we characterize minimal well-indumatched graphs of girth at least 9 and show subsequently that there is no well-indumatched graph of odd girth g greater than or equal to 9 and different from 11. On the other hand, there are infinitely many well-indumatched unicyclic graphs of girth k, where k is in 3, 5, 7 or k is an even integer greater than 2. We also show that, although the recognition of well-indumatched graphs is known to be co-NP-complete in general, one can recognize in polynomial time well-indumatched graphs where the size of maximal induced matchings is fixed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2022

Heroes in orientations of chordal graphs

We characterize all digraphs H such that orientations of chordal graphs ...
research
08/21/2023

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time

A graph G is a k-leaf power, for an integer k >= 2, if there is a tree T...
research
03/12/2019

On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five

A hole in a graph is an induced cycle of length at least 4, and an antih...
research
04/07/2019

A characterization of maximal 2-dimensional subgraphs of transitive graphs

A transitive graph is 2-dimensional if it can be represented as the inte...
research
11/23/2021

Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter

For a fixed integer, the k-Colouring problem is to decide if the vertice...
research
02/24/2018

Weisfeiler-Leman meets Homomorphisms

In this paper, we relate a beautiful theory by Lovász with a popular heu...
research
04/21/2022

The average size of maximal matchings in graphs

We investigate the ratio I(G) of the average size of a maximal matching ...

Please sign up or login with your details

Forgot password? Click here to reset