\((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs

DOI10.7151/dmgt.2331zbMath1493.05221OpenAlexW3029039572MaRDI QIDQ2158192

Didem Gözüpek, Gülnaz Boruzanlı Ekinci, Hadi Alizadeh

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2331

zbMATH Keywords

almost well-dominated graphsdomination gapwell-dominated graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• A characterization of well covered graphs of girth 5 or greater
• A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
• Locally well-dominated and locally independent well-dominated graphs
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• Well-dominated graphs without cycles of lengths 4 and 5
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• On Almost Well-Covered Graphs of Girth at Least 6
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \((C_3, C_4, C_5, C_7)\)-free almost well-dominated graphs