Characterizations of trees with equal domination parameters
From MaRDI portal
Publication:4489489
DOI<142::AID-JGT3>3.0.CO;2-V 10.1002/1097-0118(200006)34:2<142::AID-JGT3>3.0.CO;2-VzbMath0947.05065OpenAlexW4235356280MaRDI QIDQ4489489
Michael A. Henning, Johannes H. Hattingh
Publication date: 20 September 2000
Full work available at URL: https://doi.org/10.1002/1097-0118(200006)34:2<142::aid-jgt3>3.0.co;2-v
Trees (05C05) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (15)
Strong equality of Roman and weak Roman domination in trees ⋮ \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent ⋮ Construction for trees without domination critical vertices ⋮ Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs ⋮ Construction of trees and graphs with equal domination parameters ⋮ A characterization of \((2\gamma ,\gamma _{\text p})\)-trees ⋮ Restrained domination in self-complementary graphs ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ Total restrained domination in graphs with minimum degree two ⋮ Trees with equal domination and restrained domination numbers ⋮ A characterization of trees having a minimum vertex cover which is also a minimum total dominating set ⋮ Unnamed Item ⋮ Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees ⋮ On weakly connected domination in graphs. II. ⋮ Unique minimum semipaired dominating sets in trees
Cites Work
This page was built for publication: Characterizations of trees with equal domination parameters
