scientific article; zbMATH DE number 1744072

zbMath0995.05036MaRDI QIDQ4529495

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

Publication date: 22 May 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

independence numberdomination 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)

Related Items (12)

Characterization of Total Very Excellent Trees ⋮ On independent \([1, 2\)-sets in trees] ⋮ Every γ-excellent, γ-flexible graph is γ_bi-excellent ⋮ \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent ⋮ On \(\alpha\)-excellent graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Changing and unchanging of the domination number of a graph: path addition numbers ⋮ Unnamed Item ⋮ Changing and unchanging of the domination number of a graph ⋮ Roman domination excellent graphs: trees ⋮ On weakly connected domination in graphs. II. ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

This page was built for publication: