Recommendations
Cites work
- scientific article; zbMATH DE number 5844281 (Why is no real title available?)
- scientific article; zbMATH DE number 1124594 (Why is no real title available?)
- scientific article; zbMATH DE number 6843211 (Why is no real title available?)
- scientific article; zbMATH DE number 7021368 (Why is no real title available?)
- scientific article; zbMATH DE number 2170461 (Why is no real title available?)
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- 2-limited broadcast domination in subcubic graphs
- A class of trees with equal broadcast and domination numbers
- A linear‐time algorithm for broadcast domination in a tree
- Broadcast domination and multipacking in strongly chordal graphs
- Broadcast domination and multipacking: bounds and the integrality gap
- Broadcast domination in graph products of paths
- Broadcast domination in tori
- Broadcast domination of products of graphs
- Broadcast domination on block graphs in linear time
- Broadcast irredundance in graphs
- Broadcasts and domination in trees
- Broadcasts in graphs
- Broadcasts in graphs: diametrical trees
- Combinatorial optimization. Packing and covering
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- Dominating and irredundant broadcasts in graphs
- Dominating broadcast labeling in Cartesian products of graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Doubly Lexical Orderings of Matrices
- General bounds on limited broadcast domination
- Girth, minimum degree, independence, and broadcast independence
- Limited dominating broadcast in graphs
- More trees with equal broadcast and domination numbers
- New bounds for the broadcast domination number of a graph
- On the broadcast independence number of caterpillars
- On the broadcast independence number of grid graph
- On the difference between broadcast and multipacking numbers of graphs
- On the multipacking number of grid graphs
- On the upper broadcast domination number.
- Optimal broadcast domination in polynomial time
- Radial trees
- Relating broadcast independence and independence
- Relations between packing and covering numbers of a tree
- Uniquely radial trees
- k-broadcast domination and k-multipacking
Cited in
(25)- General bounds on limited broadcast domination
- A note on bounds for the broadcast domination number of graphs
- scientific article; zbMATH DE number 7021368 (Why is no real title available?)
- Broadcast domination in tori
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- New bounds for the broadcast domination number of a graph
- Lower boundary independent and hearing independent broadcasts in graphs
- Lower boundary independent broadcasts in trees
- Limited dominating broadcast in graphs
- Proving exact values for the \(2\)-limited broadcast domination number on grid graphs
- Global dominating broadcast in graphs
- Broadcasts in graphs: diametrical trees
- scientific article; zbMATH DE number 2109329 (Why is no real title available?)
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- 2-limited broadcast domination on grid graphs
- On the broadcast domination number of permutation graphs
- Graph-Theoretic Concepts in Computer Science
- Broadcast domination of lexicographic and modular products of graphs
- On the upper broadcast domination number.
- Broadcasts and domination in trees
- Maximum boundary independent broadcasts in graphs and trees
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs
- Dominating and irredundant broadcasts in graphs
- Upper broadcast domination number of caterpillars with no trunks
- Broadcast domination in subcubic graphs
This page was built for publication: Broadcast domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384108)
