Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Eternal Domination Numbers of \(4 \times n\) Grid Graphs

I. Beaton1, S. Finbow1, J.A. MacDonald1
1Department of Mathematics, Statistics and Computer Science St. Francis Xavier University, Antigonish Nova Scotia, Canada, B2G 2W5
  • Published: 31/05/2013

Abstract

The eternal domination number of graph \( G \) is the smallest set of mobile guards which can defend \( G \) against an infinite sequence of attacks on its vertices. In this paper we give results for the eternal domination numbers of \( P_4 \Box P_n \).

Citation
I. Beaton, S. Finbow, J.A. MacDonald. Eternal Domination Numbers of \(4 \times n\) Grid Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 085. 33-48. .