(C-3, C-4, C-5, C-7)-Free Almost Well-Dominated Graphs

Autor:	Hadi Alizadeh, Didem Gözüpek, Gülnaz Boruzanlı Ekinci
Jazyk:	angličtina
Rok vydání:	2022
Předmět:	Combinatorics almost well-dominated graphs Applied Mathematics well-dominated graphs Discrete Mathematics and Combinatorics domination gap Mathematics Covered Graphs
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 (C-3, C-4, C-5, C-7)-free almost well-dominated graphs by giving a complete structural characterization for such graphs. Scientific and Technological Research Council of Turkey (TUBITAK) [118E799]; BAGEP Award of the Science Academy of Turkey The support of the Scientific and Technological Research Council of Turkey (TUBITAK) under grant no. 118E799 is greatly acknowledged.; The work of Didem G~oz ~upek was also supported by the BAGEP Award of the Science Academy of Turkey.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4e363f953328cfc646a7ab642a7779d https://hdl.handle.net/11454/79059 Zobrazit plný text záznamu