Advances and Applications in Discrete Mathematics
Volume 18, Issue 4, Pages 407 - 412
(October 2017) http://dx.doi.org/10.17654/AADMOct2017_407_412 |
|
ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
William F. Klostermeyer
|
Abstract: Roman domination is a graph labeling problem in which each vertex labeled with either 0, 1 or 2 and each vertex labeled 0 must be adjacent to at least one vertex labeled 2. In this paper, we demonstrate trees that cannot be generated by a method previously claimed to generate all trees with Roman domination number equal to twice their domination number. |
Keywords and phrases: dominating set, Roman dominating set, tree. |
|
Number of Downloads: 303 | Number of Views: 965 |
|