[Formula presented]-broadcast domination and [Formula presented]-multipacking

Michael A. Henning, Gary MacGillivray, Frank Yang

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


We generalize broadcast domination by requiring that every vertex must hear a broadcast from each of [Formula presented] different vertices. Some basic theory of [Formula presented]-broadcast domination and its dual problem, [Formula presented]-multipacking, is developed. We then focus on 2-broadcast domination and show that the 2-broadcast domination number is at most three times the broadcast domination number, but can differ by any additive amount from twice the broadcast domination number. It is shown that the 2-broadcast domination number of a connected graph with [Formula presented] vertices is at most [Formula presented].

Original languageEnglish
Pages (from-to)241-251
Number of pages11
JournalDiscrete Applied Mathematics
Publication statusPublished - 11 Dec 2018


  • [Formula presented]-broadcast domination
  • [Formula presented]-multipacking

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of '[Formula presented]-broadcast domination and [Formula presented]-multipacking'. Together they form a unique fingerprint.

Cite this