On the multipacking number of grid graphs

In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$. The dual of this problem is called multipacking: a multi...

Full description

Bibliographic Details
Main Authors: Laurent Beaudou, Richard C. Brewster
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2019-06-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/4452/pdf