Let G be a graph. If G has exactly r distinct sizes of maximal independent sets, G belongs to
a collection called M r. If G∈ M r and the distinct values of its maximal independent sets are …

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 …

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 …

The square of a graph G is obtained from G by putting an edge between two distinct vertices
whenever their distance in G is 2. A graph is well-covered if every maximal independent set …

The domination gap of a graph G is defined as the di erence between the maximum and
minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs …

The domination gap of a graph G is defined as the difference between the maximum and
minimum cardinalities of a minimal dominating set in G. The term well-dominated graphs …

For a graph G we denote by α (G) the maximum size of an independent set in G and by i (G)
the minimum size of a maximal independent set in G. The independence gap of a graph G …

The independence gap of a graph was introduced by Ekim et al. in 2018 as a measure of
how far a graph is from being well-covered. It is defined as the difference between the …