(C₃, C₄, C₅, C₇)-free almost well-dominated graphs

DOI10.7151/DMGT.2331MaRDI QIDQ2158192zbMATH OpenOpenAlexFDO

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

Publication date 26 July 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Almost well-dominated bipartite graphs with minimum degree at least two
• On almost well-covered graphs of girth at least 6
• scientific article; zbMATH DE number 4063149
• On well-covered graphs of odd girth 7 or greater
• Well-dominated graphs without cycles of lengths 4 and 5

Cites work

• scientific article; zbMATH DE number 4202288 (Why is no real title available?)
• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1156679 (Why is no real title available?)
• scientific article; zbMATH DE number 2068161 (Why is no real title available?)
• A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets
• A characterization of well covered graphs of girth 5 or greater
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• A revision and extension of results on 4-regular, 4-connected, claw-free graphs
• Locally well-dominated and locally independent well-dominated graphs
• On almost well-covered graphs of girth at least 6
• Well-dominated graphs without cycles of lengths 4 and 5

Cited in

(1)

• On almost well-covered graphs of girth at least 6

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158192)