Pages that link to "Item:Q1955610"
From MaRDI portal
The following pages link to New bounds for the broadcast domination number of a graph (Q1955610):
Displaying 19 items.
- Dominating and irredundant broadcasts in graphs (Q507582) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Broadcast domination in subcubic graphs (Q2093109) (← 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)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- Broadcast irredundance in graphs (Q2799827) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- General bounds on limited broadcast domination (Q4560266) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs (Q5155707) (← links)
- Broadcast domination and multipacking: bounds and the integrality gap (Q5197586) (← links)
- Asymptotically Optimal Bounds for (t,2) Broadcast Domination on Finite Grids (Q5235437) (← links)
- Linear programming approach for various domination parameters (Q5859511) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897555) (← links)
- 2-limited broadcast domination on grid graphs (Q6110604) (← links)
- On the broadcast independence number of circulant graphs (Q6637055) (← links)