# Bounds for the $m$-Eternal Domination Number of a Graph

## DOI:

https://doi.org/10.11575/cdm.v12i2.62550## Keywords:

dominating set, eternal dominating set, independent set, cubic graph, bipartite graph## Abstract

Mobile guards on the vertices of a graph are used to defend the graph against an infinite sequence of attacks on vertices. A guard must move from a neighboring vertex to an attacked vertex (we assume attacks happen only at vertices containing no guard and that each vertex contains at most one guard). More than one guard is allowed to move in response to an attack. The $m$-eternaldomination number, $\edom(G)$, of a graph $G$ is the minimum number of guards needed to defend $G$ against any such sequence. We show that if $G$ is a connected graph with minimum degree at least~$2$ and of order~$n \ge 5$, then $\edom(G) \le \left\lfloor \frac{n-1}{2} \right\rfloor$, and this bound is tight. We also prove that if $G$ is a cubic bipartite graph of order~$n$, then $\edom(G) \le \frac{7n}{16}$.## References

E. Chambers, W. Kinnersly, N. Prince, Mobile eternal security in graphs, manuscript (2008).

S. Finbow, M.-E. Messinger, M. van Bommel, Eternal domination in $3 \times n$ grids. Australas. J. Combin. 61 (2015), 156-174.

W. Goddard, S.M. Hedetniemi, S.T. Hedetniemi, Eternal security in graphs, J. Combin. Math. Combin. Comput. 52 (2005), 169-180.

J. Goldwasser, W. Klostermeyer, C. M. Mynhardt, Eternal protection in grid graphs. Utilitas Math. ~\textbf{91} (2013), 47--64.

T. W. Haynes, S. T. Hedetniemi, P. J. Slater, Fundamentals of Domination in Graphs. Marcel Dekker, New York, 1998.

M. A. Henning, I. Schiermeyer, A. Yeo, A new bound on the domination number of graphs with minimum degree two, Electronic Journal of Combinatorics 18 (2011), paper P12.

W. Klostermeyer, G. MacGillivray, Eternally secure sets, independence sets, and Cliques. AKCE Int. J. Graphs Comb. 2 (2005), 119-122.

W. Klostermeyer, G. MacGillivray, Eternal dominating sets in graphs, J. Combin. Math. Combin. Comput. 68 (2009), 97-111.

W. Klostermeyer, G. MacGillivray, Eternal domination in trees, to appear in J. Combin. Math. Combin. Comput. (2015).

W. Klostermeyer, C.M.~Mynhardt, Vertex covers and eternal dominating sets, Discrete Applied Mathematics 160 (2012), pp. 1183-1190.

W. Klostermeyer, C.~M.~Mynhardt, Protecting a graph with mobile guards, http://arxiv.org/abs/1407.5228

A. Kostochka, B. Stodolsky, On domination in connected cubic graphs, Discrete Math. 304 (2005), pp. 45--50.

A. V. Kostochka, C. Stocker, A new bound on the domination number of connected cubic graphs. Sib. Elektron. Mat. Izv. 6 (2009), 465–504.

W. McCuaig, B. Shepherd, Domination in graphs with minimum degree two. J. Graph Theory 13 (1989), 749-762.

O. Ore, Theory of graphs. Amer. Math. Soc. Transl. 38 (Amer. Math. Soc., Providence, RI, 1962), 206--212.

J. Petersen, Die theorie der regulären graphs, Acta Mathematica 15 (1891), pp. 193-220.

B. Reed, Paths, stars, and the number three, Combin. Probab. Comput. 5 (1996), pp. 277--295.

## Downloads

## Published

## Issue

## Section

## License

This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).

The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.

Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:

The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.

The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.

The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.

In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.

The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.

If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.

The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.

The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/

**Attribution-NoDerivsCC BY-ND**

This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.