Radial trees

DOI10.1016/j.disc.2009.04.024zbMath1221.05051OpenAlexW2161551572MaRDI QIDQ1045085

J. Blot

Publication date: 15 December 2009

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

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

zbMATH Keywords

broadcastbroadcast dominationdominating broadcastradial tree

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (18)

Broadcast domination and multipacking in strongly chordal graphs ⋮ 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 ⋮ 2-limited broadcast domination in subcubic graphs ⋮ New bounds for the broadcast domination number of a graph ⋮ On the broadcast independence number of grid graph ⋮ Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs ⋮ Dominating and irredundant broadcasts in graphs ⋮ On the broadcast independence number of caterpillars ⋮ Broadcasts and domination in trees ⋮ \(k\)-broadcast domination and \(k\)-multipacking ⋮ Bounds on the sum of broadcast domination number and strong metric dimension of graphs ⋮ Broadcast Domination in Graphs ⋮ Relating broadcast independence and independence ⋮ Broadcast domination in subcubic graphs ⋮ Broadcast domination and multipacking: bounds and the integrality gap ⋮ 2-limited dominating broadcasts on cubic graphs without induced 4-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal broadcast domination in polynomial time
• Broadcasts in graphs
• A linear‐time algorithm for broadcast domination in a tree

This page was built for publication: Radial trees