Advances and Applications in Discrete Mathematics
Volume 4, Issue 2, Pages 105 - 114
(October 2009)
|
|
ETERNAL DOMINATING SETS IN KNESER GRAPHS
William F. Klostermeyer (U.S.A.)
|
Abstract: The eternal domination number of a graph is the number of guards needed at vertices of the graph to defend the graph against any sequence of attacks. We consider both the model in which one guard can move per attack and a guard can move across at most one edge to defend an attack as well as the model in which all guards may move in response to an attack. In this paper, we examine the eternal domination number of some Kneser graphs and their complements. |
Keywords and phrases: dominating set, eternal dominating set, Kneser graph. |
|
Number of Downloads: 258 | Number of Views: 586 |
|