scientific article; zbMATH DE number 1744072

zbMATH Open0995.05036MaRDI QIDQ4529495FDOQ4529495

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

Publication date: 22 May 2002

Title of this publication is not available (Why is that?)

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

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)

Cited In (18)

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