Eternal total domination in graphs

Document Type

Article

Publication Date

10-1-2012

Abstract

Eternal domination of a graph requires the vertices of the graph to be protected, against infinitely long sequences of attacks, by guards located at vertices, with the requirement that the configuration of guards induces a dominating set at all times. We study some variations of this concept in which the configuration of guards induce total dominating sets. We consider two models of the problem: one in which only one guard moves at a time and one in which all guards may move simultaneously. A number of upper and lower bounds are given for the number of guards required.

Publication Title

Ars Combinatoria

Volume

107

First Page

473

Last Page

492

ISSN

03817032

This document is currently not available here.

Share

COinS