Triangulations and equality in the domination chain

DOI10.1016/J.DAM.2015.05.025MaRDI QIDQ494427zbMATH OpenOpenAlexFDO

Authors Stephen Finbow, C. M. van Bommel

Publication date 1 September 2015

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2015.05.025

zbMATH Keywords

dominationwell-covered graphsdomination chain

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Construction of trees and graphs with equal domination parameters
• Characterizations of trees with equal domination parameters
• Strong equality of domination parameters in graphs
• Strong equality of domination parameters in trees
• scientific article; zbMATH DE number 706830

Cites work

• scientific article; zbMATH DE number 434906 (Why is no real title available?)
• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1286748 (Why is no real title available?)
• A characterization of well covered graphs of girth 5 or greater
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Complexity results for well‐covered graphs
• On well-covered triangulations. I
• On well-covered triangulations. II.
• On well-covered triangulations. III
• Some covering concepts in graphs
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• WELL-COVERED GRAPHS: A SURVEY
• Well irredundant graphs

Cited in

(5)

• Equivalences to the triangulation conjecture
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Irredundance
• Well-totally-dominated graphs
• On well-dominated direct, Cartesian and strong product graphs

This page was built for publication: Triangulations and equality in the domination chain

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