The following pages link to Broadcasts and domination in trees (Q539885):
Displaying 20 items.
- Exponential domination in subcubic graphs (Q504979) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- Radial trees (Q1045085) (← links)
- On the broadcast independence number of caterpillars (Q1752581) (← links)
- New bounds for the broadcast domination number of a graph (Q1955610) (← links)
- Broadcasts on paths and cycles (Q2192097) (← links)
- On the broadcast independence number of grid graph (Q2441352) (← links)
- A class of trees with equal broadcast and domination numbers (Q2848716) (← links)
- Limited dominating broadcast in graphs (Q2874036) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- (Q4604110) (← links)
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs (Q5155707) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Broadcast domination and multipacking: bounds and the integrality gap (Q5197586) (← links)
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs (Q5216449) (← links)
- Broadcast domination of lexicographic and modular products of graphs (Q6101460) (← links)
- A note on bounds for the broadcast domination number of graphs (Q6130225) (← links)
- Global dominating broadcast in graphs (Q6174167) (← links)
- Proving exact values for the \(2\)-limited broadcast domination number on grid graphs (Q6599802) (← links)
- On the broadcast independence number of circulant graphs (Q6637055) (← links)
