Radial trees

DOI10.1016/J.DISC.2009.04.024MaRDI QIDQ1045085zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Uniquely radial trees
• Broadcasts and domination in trees
• More trees with equal broadcast and domination numbers
• Broadcasts in graphs: diametrical trees
• Broadcasts on paths and cycles

Cites work

• A linear‐time algorithm for broadcast domination in a tree
• Broadcasts in graphs
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 2109329 (Why is no real title available?)
• Optimal broadcast domination in polynomial time

Cited in

(31)

• On the broadcast independence number of caterpillars
• k-broadcast domination and k-multipacking
• New bounds for the broadcast domination number of a graph
• Broadcast domination in subcubic graphs
• 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
• Broadcasts on paths and cycles
• 2-limited broadcast domination in subcubic graphs
• Improved lower bounds for the radio number of trees
• Relating broadcast independence and independence
• Broadcast domination and multipacking in strongly chordal graphs
• On the broadcast independence number of grid graph
• Diametral broadcast graphs
• A class of trees with equal broadcast and domination numbers
• Broadcast domination in graphs
• Dominating and irredundant broadcasts in graphs
• Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
• Broadcast domination and multipacking: bounds and the integrality gap
• Bounds on the sum of broadcast domination number and strong metric dimension of graphs
• More trees with equal broadcast and domination numbers
• Broadcasts and domination in trees
• Uniquely radial trees
• Pointed Brauer trees
• Broadcast domination of lexicographic and modular products of graphs
• A note on bounds for the broadcast domination number of graphs
• Broadcast domination in line graphs of trees.
• Proving exact values for the \(2\)-limited broadcast domination number on grid graphs
• On the broadcast independence number of circulant graphs
• Lower boundary independent and hearing independent broadcasts in graphs
• Critical aspects in broadcast domination
• On the broadcast independence number of locally uniform 2-lobsters
• Lower boundary independent broadcasts in trees

This page was built for publication: Radial trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045085)