The following pages link to Broadcasts in graphs (Q2581560):
Displaying 45 items.
- Dominating broadcast labeling in Cartesian products of graphs (Q324960) (← links)
- Exponential domination in subcubic graphs (Q504979) (← links)
- Dominating and irredundant broadcasts in graphs (Q507582) (← links)
- Broadcasts and domination in trees (Q539885) (← links)
- Bounds on the exponential domination number (Q729783) (← links)
- Optimal broadcast domination in polynomial time (Q856876) (← links)
- Radial trees (Q1045085) (← links)
- On the broadcast independence number of caterpillars (Q1752581) (← links)
- \(k\)-broadcast domination and \(k\)-multipacking (Q1801065) (← links)
- New bounds for the broadcast domination number of a graph (Q1955610) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Broadcast domination in subcubic graphs (Q2093109) (← links)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles (Q2112664) (← links)
- Algorithmic aspects of broadcast independence (Q2127617) (← links)
- Broadcasts on paths and cycles (Q2192097) (← links)
- 2-limited broadcast domination in subcubic graphs (Q2197488) (← links)
- On the broadcast domination number of permutation graphs (Q2285130) (← links)
- Relating broadcast independence and independence (Q2329172) (← links)
- On \((t,r)\) broadcast domination numbers of grids (Q2348050) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- On the broadcast independence number of grid graph (Q2441352) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← links)
- Diametral broadcast graphs (Q2449105) (← links)
- Broadcast irredundance in graphs (Q2799827) (← links)
- Limited dominating broadcast in graphs (Q2874036) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- The Private Neighbor Concept (Q3384113) (← links)
- Broadcasting in Bounded Degree Graphs (Q3989008) (← links)
- (Q4552230) (← links)
- (Q4622603) (← links)
- Independent domination in directed graphs (Q4957541) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- Projects in (t, r) Broadcast Domination (Q5118419) (← 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)
- $k$-Efficient partitions of graphs (Q5242941) (← links)
- Girth, minimum degree, independence, and broadcast independence (Q5242945) (← links)
- Broadcasting in random graphs (Q5967062) (← 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)
- Upper broadcast domination number of caterpillars with no trunks (Q6669817) (← links)
