ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
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.
dominating set, Roman dominating set, tree.
