Almost Well-Covered Graphs Without Short Cycles

08/15/2017
by   Tınaz Ekim, et al.
0

We study graphs in which the maximum and the minimum sizes of a maximal independent set differ by exactly one. We call these graphs almost well-covered, in analogy with the class of well-covered graphs, in which all maximal independent sets have the same size. A characterization of graphs of girth at least 8 having exactly two different sizes of maximal independent sets due to Finbow, Hartnell, and Whitehead implies a polynomial-time recognition algorithm for the class of almost well-covered graphs of girth at least 8. We focus on the structure of almost well-covered graphs of girth at least 6. We give a complete structural characterization of a subclass of the class of almost well-covered graphs of girth at least 6, a polynomially testable characterization of another one, and a polynomial-time recognition algorithm of almost well-covered {C_3,C_4,C_5,C_7}-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2022

Computing Well-Covered Vector Spaces of Graphs using Modular Decomposition

A graph is well-covered if all its maximal independent sets have the sam...
research
08/08/2022

A note on independent sets in sparse-dense graphs

Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwan...
research
06/29/2023

Recognizing 𝐖_2 Graphs

Let G be a graph. A set S ⊆ V(G) is independent if its elements are pair...
research
04/02/2023

Gallai-like characterization of strong cocomparability graphs

Strong cocomparability graphs are the reflexive graphs whose adjacency m...
research
05/10/2019

Robustness: a New Form of Heredity Motivated by Dynamic Networks

We investigate a special case of hereditary property in graphs, referred...
research
08/30/2018

Recognizing Generating Subgraphs in Graphs without Cycles of Lengths 6 and 7

Let B be an induced complete bipartite subgraph of G on vertex sets of b...
research
04/27/2018

Letter graphs and geometric grid classes of permutations: characterization and recognition

In this paper, we reveal an intriguing relationship between two seemingl...

Please sign up or login with your details

Forgot password? Click here to reset