\(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent

DOI10.1016/j.disc.2006.02.016zbMath1113.05073OpenAlexW2084152059MaRDI QIDQ868329

Tamara Burton, David P. Sumner

Publication date: 2 March 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.02.016

zbMATH Keywords

treedominationcriticalenddotexcellentrestrained

Mathematics Subject Classification ID

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

Related Items (4)

Total domination dot-critical graphs ⋮ Total domination dot-stable graphs ⋮ Roman domination excellent graphs: trees ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

Cites Work

• Domination alteration sets in graphs
• Domination dot-critical graphs
• A characterization of \(i\)-excellent trees
• Strong equality of domination parameters in trees
• Total domination excellent trees
• Vertex domination-critical graphs
• Characterizations of trees with equal domination parameters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent