(C3, C4, C5, C7)-Free Almost Well-Dominated Graphs

Autor: Alizadeh Hadi, Gözüpek Didem, Ekinci Gülnaz Boruzanlı
Jazyk: angličtina
Rok vydání: 2022
Předmět:
Zdroj: Discussiones Mathematicae Graph Theory, Vol 42, Iss 4, Pp 1099-1117 (2022)
Druh dokumentu: article
ISSN: 2083-5892
DOI: 10.7151/dmgt.2331
Popis: 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 referring to the graphs with domination gap zero, was first introduced by Finbow et al. [Well-dominated graphs: A collection of well-covered ones, Ars Combin. 25 (1988) 5–10]. In this paper, we focus on the graphs with domination gap one which we term almost well-dominated graphs. While the results by Finbow et al. have implications for almost well-dominated graphs with girth at least 8, we extend these results to (C3, C4, C5, C7)-free almost well-dominated graphs by giving a complete structural characterization for such graphs.
Databáze: Directory of Open Access Journals