Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees

DOI10.1007/s11766-008-1968-0zbMath1199.05265OpenAlexW923434093WikidataQ60630630 ScholiaQ60630630MaRDI QIDQ1032812

Zhenbing Zeng, Lei Chen, Chang-hong Lu

Publication date: 11 November 2009

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-008-1968-0

zbMATH Keywords

treedominationpower dominationpaired-domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of \((2\gamma ,\gamma _{\text p})\)-trees
• Paired-domination of trees
• Strong equality of domination parameters in trees
• Paired domination on interval and circular-arc graphs
• Trees with equal domination and restrained domination numbers
• Characterizations of trees with equal paired and double domination numbers
• Power domination in graphs
• E ₁₁ and M theory
• Characterizations of trees with equal domination parameters
• Paired-domination in graphs
• Domination in Graphs Applied to Electric Power Networks

This page was built for publication: Constructive characterizations of \( (\gamma_p,\gamma)\)-and \( (\gamma_p, \gamma_{pr})\)-trees