Broadcasts and domination in trees

DOI10.1016/j.disc.2009.12.012zbMath1222.05196OpenAlexW2092204243MaRDI QIDQ539885

Yong-Cai Geng, Sumit K. Garg

Publication date: 31 May 2011

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

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

zbMATH Keywords

domination numberbroadcastbroadcast dominationdominating broadcastradial tree

Mathematics Subject Classification ID

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

Related Items (12)

Broadcasts on paths and cycles ⋮ Broadcast domination of lexicographic and modular products of graphs ⋮ A note on bounds for the broadcast domination number of graphs ⋮ New bounds for the broadcast domination number of a graph ⋮ On the broadcast independence number of grid graph ⋮ Exponential domination in subcubic graphs ⋮ Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs ⋮ On the broadcast independence number of caterpillars ⋮ Bounds on the exponential domination number ⋮ Broadcast Domination in Graphs ⋮ Broadcast domination and multipacking: bounds and the integrality gap ⋮ LIMITED DOMINATING BROADCAST IN GRAPHS

Cites Work

• Optimal broadcast domination in polynomial time
• Radial trees
• A linear algorithm for the domination number of a tree
• Broadcasts in graphs
• A linear‐time algorithm for broadcast domination in a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Broadcasts and domination in trees