A characterization of \(i\)-excellent trees
From MaRDI portal
Publication:1598814
DOI10.1016/S0012-365X(01)00274-6zbMath1028.05079OpenAlexW2014650830MaRDI QIDQ1598814
Teresa W. Haynes, Michael A. Henning
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00274-6
Trees (05C05) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Domination, independent domination and \(k\)-independence in trees ⋮ On independent \([1, 2\)-sets in trees] ⋮ \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent ⋮ A note on connected bipartite graphs having independent domination number half their order. ⋮ Trees with equal domination and restrained domination numbers ⋮ 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: A characterization of \(i\)-excellent trees
