Broadcast Domination in Graphs

DOI10.1007/978-3-030-58892-2_2zbMath1479.05239OpenAlexW3157919786MaRDI QIDQ3384108

Gary MacGillivray, Feiran Yang, Michael A. Henning

Publication date: 14 December 2021

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

Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_2

zbMATH Keywords

dominating setdominating broadcast function

Mathematics Subject Classification ID

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

Related Items (2)

2-limited broadcast domination on grid graphs ⋮ 2-limited dominating broadcasts on cubic graphs without induced 4-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating broadcast labeling in Cartesian products of graphs
• Dominating and irredundant broadcasts in graphs
• Broadcasts and domination in trees
• Domination, independent domination, and duality in strongly chordal graphs
• Optimal broadcast domination in polynomial time
• Radial trees
• Relations between packing and covering numbers of a tree
• On the broadcast independence number of caterpillars
• \(k\)-broadcast domination and \(k\)-multipacking
• New bounds for the broadcast domination number of a graph
• 2-limited broadcast domination in subcubic graphs
• Relating broadcast independence and independence
• Broadcast domination and multipacking in strongly chordal graphs
• On the broadcast independence number of grid graph
• Broadcasts in graphs
• Combinatorial Optimization
• LIMITED DOMINATING BROADCAST IN GRAPHS
• Broadcast Domination on Block Graphs in Linear Time
• Doubly Lexical Orderings of Matrices
• General bounds on limited broadcast domination
• Broadcasts in Graphs: Diametrical Trees
• Broadcast Domination in Tori
• Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
• 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

This page was built for publication: Broadcast Domination in Graphs