Characterizations of trees with equal domination parameters

DOI10.1002/1097-0118(200006)34:2%3C142::AID-JGT3%3E3.0.CO;2-VMaRDI QIDQ4489489zbMATH OpenOpenAlexFDO

Authors Johannes H. Hattingh, Michael A. Henning

Publication date 20 September 2000

Full work available at URL https://doi.org/10.1002/1097-0118(200006)34:2%3C142::aid-jgt3%3E3.0.co;2-v

zbMATH Keywords

characterizationdominationindependent dominationrestrained dominationtreeweak domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Construction of trees and graphs with equal domination parameters
• scientific article; zbMATH DE number 1507962
• A characterization of (_t,_2)-trees
• scientific article; zbMATH DE number 4055636
• Strong equality of domination parameters in trees

Cites work

• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Graphs with large restrained domination number
• Restrained domination in graphs
• Strong weak domination and domination balance in a graph

Cited in

(22)

• Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees
• Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
• Unique minimum semipaired dominating sets in trees
• Restrained domination in self-complementary graphs
• Construction of trees and graphs with equal domination parameters
• On equality in an upper bound for the restrained and total domination numbers of a graph
• Trees with equal domination and restrained domination numbers
• On weakly connected domination in graphs. II.
• Construction for trees without domination critical vertices
• Strong equality of Roman and weak Roman domination in trees
• scientific article; zbMATH DE number 6376879 (Why is no real title available?)
• scientific article; zbMATH DE number 1507962 (Why is no real title available?)
• A characterization of trees with equal 2-domination and 2-independence numbers
• scientific article; zbMATH DE number 2108130 (Why is no real title available?)
• Triangulations and equality in the domination chain
• A characterization of trees with equal independent domination and secure domination numbers
• Total perfect codes in graphs realized by commutative rings
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• A note on total co-independent domination in trees
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
• A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
• Total restrained domination in graphs with minimum degree two

This page was built for publication: Characterizations of trees with equal domination parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489489)