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

Alizadeh H., Gözüpek D., Ekinci G. B.

Discussiones Mathematicae - Graph Theory, cilt.42, sa.4, ss.1099-1117, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 42 Sayı: 4
  • Basım Tarihi: 2022
  • Doi Numarası: 10.7151/dmgt.2331
  • Dergi Adı: Discussiones Mathematicae - Graph Theory
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Central & Eastern European Academic Source (CEEAS), MathSciNet, zbMATH, Directory of Open Access Journals
  • Sayfa Sayıları: ss.1099-1117
  • Anahtar Kelimeler: well-dominated graphs, almost well-dominated graphs, domination gap, COVERED GRAPHS
  • Kocaeli Üniversitesi Adresli: Hayır

Özet

© 2020 Hadi Alizadeh et al., published by Sciendo.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.