- Tytuł:
- (C3, C4, C5, C7)-Free Almost Well-Dominated Graphs
- Autorzy:
-
Alizadeh, Hadi
Gözüpek, Didem
Ekinci, Gülnaz Boruzanlı - Powiązania:
- https://bibliotekanauki.pl/articles/32387984.pdf
- Data publikacji:
- 2022-11-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
well-dominated graphs
almost well-dominated graphs
domination gap - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1099-1117
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł