Broadcasts on paths and cycles

DOI10.1016/j.dam.2020.01.030zbMath1442.05220arXiv1906.05089OpenAlexW3005534784MaRDI QIDQ2192097

Sabrina Bouchouika, Isma Bouchemakh, Eric Sopena

Publication date: 29 June 2020

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

Full work available at URL: https://arxiv.org/abs/1906.05089

zbMATH Keywords

cyclepathbroadcastdominating broadcastindependent broadcastirredundant broadcastpacking broadcast

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Broadcast domination in subcubic graphs

Cites Work

• Dominating and irredundant broadcasts in graphs
• Broadcasts and domination in trees
• Optimal broadcast domination in polynomial time
• Radial trees
• On the broadcast independence number of caterpillars
• New bounds for the broadcast domination number of a graph
• Relating broadcast independence and independence
• Broadcast domination and multipacking in strongly chordal graphs
• On the broadcast independence number of grid graph
• Unsolved algorithmic problems on trees
• Broadcasts in graphs
• Broadcast Domination on Block Graphs in Linear Time
• Broadcasts in Graphs: Diametrical Trees
• A linear‐time algorithm for broadcast domination in a tree
• Broadcast domination and multipacking: bounds and the integrality gap
• On the multipacking number of grid graphs
• Girth, minimum degree, independence, and broadcast independence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Broadcasts on paths and cycles