Recommendations
Cited in
(15)- Broadcasts on paths and cycles
- On the broadcast independence number of grid graph
- Limited dominating broadcast in graphs
- Broadcast domination of products of graphs
- Broadcast domination in graphs
- Upper bounds on the broadcast function using minimum dominating sets
- Broadcasts in graphs: diametrical trees
- More trees with equal broadcast and domination numbers
- Comparing upper broadcast domination and boundary independence broadcast numbers of graphs
- A note on bounds for the broadcast domination number of graphs
- Global dominating broadcast in graphs
- Upper bounds of k-limited dominating broadcasts for some grid graphs
- On the broadcast independence number of circulant graphs
- Upper broadcast domination number of caterpillars with no trunks
- On the broadcast independence number of locally uniform 2-lobsters
This page was built for publication: On the upper broadcast domination number.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355041)