scientific article; zbMATH DE number 2170461
From MaRDI portal
Publication:4677956
Recommendations
Cited in
(20)- On the broadcast independence number of caterpillars
- New bounds for the broadcast domination number of a graph
- On the complexity of broadcast domination and multipacking in digraphs
- Broadcast domination in subcubic graphs
- Algorithmic aspects of broadcast independence
- Broadcasts on paths and cycles
- 2-limited broadcast domination in subcubic graphs
- On the broadcast domination number of permutation graphs
- Broadcast domination and multipacking in strongly chordal graphs
- On the broadcast independence number of grid graph
- A decomposition approach for solving a broadcast domination network design problem
- Broadcast domination on block graphs in linear time
- Broadcast covers in graphs
- Broadcast domination in graphs
- On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
- A linear‐time algorithm for broadcast domination in a tree
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs
- Graph-Theoretic Concepts in Computer Science
- On the broadcast independence number of locally uniform 2-lobsters
- Optimal broadcast domination in polynomial time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4677956)
