A characterization of \((2\gamma ,\gamma _{\text p})\)-trees

DOI10.1016/j.disc.2007.06.034zbMath1165.05023OpenAlexW2317957561MaRDI QIDQ932620

Xin Min Hou

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.034

zbMATH Keywords

treedomination numberpaired-domination number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Paired domination versus domination and packing number in graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Certified domination ⋮ Paired Domination in Graphs ⋮ Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Paired-domination of trees
• Strong equality of domination parameters in trees
• Total domination in graphs
• Characterizations of trees with equal domination parameters
• Paired-domination in graphs