Changing and unchanging domination: A classification

DOI10.1016/S0012-365X(03)00185-7MaRDI QIDQ1415545zbMATH OpenOpenAlexFDO

Authors Teresa W. Haynes, Michael A. Henning

Publication date 4 December 2003

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(03)00185-7

zbMATH Keywords

Changing and unchanging domination numbersCritical dominationDomination

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 26480
• Changing and unchanging of the domination number of a graph
• scientific article; zbMATH DE number 68339
• scientific article; zbMATH DE number 1002451
• scientific article; zbMATH DE number 989727

Cites work

• An extremal problem for edge domination insensitive graphs
• Critical concepts in domination
• Domination alteration sets in graphs
• Domination critical graphs
• Domination critical graphs
• Hamiltonian properties of domination-critical graphs
• scientific article; zbMATH DE number 26480 (Why is no real title available?)
• scientific article; zbMATH DE number 68339 (Why is no real title available?)
• scientific article; zbMATH DE number 1043910 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1124609 (Why is no real title available?)
• scientific article; zbMATH DE number 1472135 (Why is no real title available?)
• scientific article; zbMATH DE number 881277 (Why is no real title available?)
• scientific article; zbMATH DE number 1389223 (Why is no real title available?)
• Independence and hamiltonicity in 3-domination-critical graphs
• The diameter of domination k‐critical graphs
• Vertex domination-critical graphs
• Vertex domination‐critical graphs
• Vertices contained in every minimum dominating set of a tree

Cited in

(16)

• Minimum fractional dominating functions and maximum fractional packing functions
• The diversity of domination
• A characterization of domination weak bicritical graphs with large diameter
• Graphs with equal domination and covering numbers
• Effect of vertex deletion on the weak Roman domination number of a graph
• Relations between edge removing and edge subdivision concerning domination number of a graph
• Preserving dominance relations through disaggregation: the evil and the saint
• Changing and unchanging of the domination number of a graph
• Construction for trees without domination critical vertices
• scientific article; zbMATH DE number 989727 (Why is no real title available?)
• scientific article; zbMATH DE number 109199 (Why is no real title available?)
• A note on Roman domination: changing and unchanging
• Roman domination excellent graphs: trees
• Critical concepts of restrained domination in signed graphs
• Domatically perfect graphs
• Domination parameters and the removal of matchings

This page was built for publication: Changing and unchanging domination: A classification

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