Strong equality of domination parameters in trees
From MaRDI portal
Publication:1861245
DOI10.1016/S0012-365X(02)00451-XzbMath1020.05051MaRDI QIDQ1861245
Peter J. Slater, Teresa W. Haynes, Michael A. Henning
Publication date: 16 March 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
05C05: Trees
05C75: Structural characterization of families of graphs
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Strong equality of Roman and weak Roman domination in trees, A note on an induced subgraph characterization of domination perfect graphs, Strong equality between the 2-rainbow domination and independent 2-rainbow domination numbers in trees, \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent, A characterization of \((2\gamma ,\gamma _{\text p})\)-trees, Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees, Some notes on the isolate domination in graphs, Construction of trees and graphs with equal domination parameters, Vertices contained in all minimum paired-dominating sets of a tree