k-broadcast domination and k-multipacking
DOI10.1016/J.DAM.2018.04.022zbMATH Open1398.05151OpenAlexW2805891430MaRDI QIDQ1801065FDOQ1801065
Authors: Michael A. Henning, Gary MacGillivray, Frank Yang
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.04.022
Recommendations
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (9)
- 2-limited dominating broadcasts on cubic graphs without induced 4-cycles
- On the complexity of broadcast domination and multipacking in digraphs
- Broadcast domination in graphs
- Broadcast domination and multipacking: bounds and the integrality gap
- On the multipacking number of grid graphs
- On the difference between broadcast and multipacking numbers of graphs
- On the complexity of \textsc{broadcast domination} and \textsc{Multipacking} in digraphs
- Broadcast domination in subcubic graphs
- 2-limited broadcast domination in subcubic graphs
This page was built for publication: \(k\)-broadcast domination and \(k\)-multipacking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801065)