On the broadcast independence number of locally uniform 2-lobsters
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5844281 (Why is no real title available?)
- scientific article; zbMATH DE number 6843211 (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?)
- A class of trees with equal broadcast and domination numbers
- A linear‐time algorithm for broadcast domination in a tree
- Algorithmic aspects of broadcast independence
- 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 of products of graphs
- Broadcasts and domination in trees
- Broadcasts in graphs
- Broadcasts in graphs: diametrical trees
- Dominating and irredundant broadcasts in graphs
- Girth, minimum degree, independence, and broadcast independence
- 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
- Uniquely radial trees
- Unsolved algorithmic problems on trees
This page was built for publication: On the broadcast independence number of locally uniform 2-lobsters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985941)
