Characterizations of trees with equal domination parameters

DOI10.1002/1097-0118(200006)34:2%3C142::AID-JGT3%3E3.0.CO;2-VzbMATH Open0947.05065OpenAlexW4235356280MaRDI QIDQ4489489FDOQ4489489

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

Recommendations

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

zbMATH Keywords

treecharacterizationdominationrestrained dominationindependent dominationweak 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)

Cites Work

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

Cited In (21)

• Unique minimum semipaired dominating sets in trees
• A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
• Restrained domination in self-complementary graphs
• Title not available (Why is that?)
• Strong equality of Roman and weak Roman domination in trees
• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
• Total perfect codes in graphs realized by commutative rings
• Title not available (Why is that?)
• A characterization of trees with equal 2-domination and 2-independence numbers
• A note on total co-independent domination in trees
• Construction for trees without domination critical vertices
• 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
• On weakly connected domination in graphs. II.
• Title not available (Why is that?)
• A characterization of trees with equal independent domination and secure domination numbers
• A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
• Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs
• Trees with equal domination and restrained domination numbers
• Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-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)