On Almost Well-Covered Graphs of Girth at Least 6
Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 2
Cet article a éte moissonné depuis la source Episciences
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference between the maximum and minimum sizes of a maximal independent set in $G$. While the well-covered graphs are exactly the graphs of independence gap zero, we investigate in this paper graphs of independence gap one, which we also call almost well-covered graphs. Previous works due to Finbow et al. (1994) and Barbosa et al. (2013) have implications for the structure of almost well-covered graphs of girth at least $k$ for $k\in \{7,8\}$. We focus on almost well-covered graphs of girth at least $6$. We show that every graph in this class has at most two vertices each of which is adjacent to exactly $2$ leaves. We give efficiently testable characterizations of almost well-covered graphs of girth at least $6$ having exactly one or exactly two such vertices. Building on these results, we develop a polynomial-time recognition algorithm of almost well-covered $\{C_3,C_4,C_5,C_7\}$-free graphs.
@article{DMTCS_2018_20_2_a14,
author = {Ekim, T{\i}naz and G\"oz\"upek, Didem and Hujdurovi\'c, Ademir and Milani\v{c}, Martin},
title = {On {Almost} {Well-Covered} {Graphs} of {Girth} at {Least} 6},
journal = {Discrete mathematics & theoretical computer science},
year = {2018},
volume = {20},
number = {2},
doi = {10.23638/DMTCS-20-2-17},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-17/}
}
TY - JOUR AU - Ekim, Tınaz AU - Gözüpek, Didem AU - Hujdurović, Ademir AU - Milanič, Martin TI - On Almost Well-Covered Graphs of Girth at Least 6 JO - Discrete mathematics & theoretical computer science PY - 2018 VL - 20 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-17/ DO - 10.23638/DMTCS-20-2-17 LA - en ID - DMTCS_2018_20_2_a14 ER -
%0 Journal Article %A Ekim, Tınaz %A Gözüpek, Didem %A Hujdurović, Ademir %A Milanič, Martin %T On Almost Well-Covered Graphs of Girth at Least 6 %J Discrete mathematics & theoretical computer science %D 2018 %V 20 %N 2 %U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-20-2-17/ %R 10.23638/DMTCS-20-2-17 %G en %F DMTCS_2018_20_2_a14
Ekim, Tınaz; Gözüpek, Didem; Hujdurović, Ademir; Milanič, Martin. On Almost Well-Covered Graphs of Girth at Least 6. Discrete mathematics & theoretical computer science, Tome 20 (2018) no. 2. doi: 10.23638/DMTCS-20-2-17
Cité par Sources :