scientific article; zbMATH DE number 1744072

MaRDI QIDQ4529495zbMATH OpenFDO

Authors Teresa W. Haynes, Sandra M. Hedetniemi, Stephen T. Hedetniemi, Gerd H. Fricke, Renu C. Laskar

Publication date 22 May 2002

zbMATH Keywords

domination numberindependence numberirredundance number\(\mu\)-excellent graph\(\mu\)-excellent tree

Mathematics Subject Classification ID

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

Recommendations

• A characterization of \(i\)-excellent trees
• Very excellent graphs and rigid very excellent graphs
• Total domination excellent trees
• Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent

Cited in

(18)

• Roman domination excellent graphs: trees
• \(\beta_0\)-excellent graphs
• Very excellent graphs and rigid very excellent graphs
• Changing and unchanging of the domination number of a graph
• On independent \([1, 2]\)-sets in trees
• scientific article; zbMATH DE number 1439477 (Why is no real title available?)
• Characterization of total very excellent trees
• \(\beta _{0}\)-excellent graphs
• scientific article; zbMATH DE number 7528087 (Why is no real title available?)
• Changing and unchanging of the domination number of a graph: path addition numbers
• On bondage numbers of graphs: a survey with some comments
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
• Every γ-excellent, γ-flexible graph is γ_bi-excellent
• The valuative tree
• On \(\alpha\)-excellent graphs
• Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
• On weakly connected domination in graphs. II.
• A characterization of \(i\)-excellent trees

This page was built for publication:

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