Roman domination number of Generalized Petersen Graphs P(n,2)
Combinatorics
2015-03-19 v1
Abstract
A on a graph is a function satisfying the condition that every vertex with is adjacent to at least one vertex with . The of a Roman domination function is the value . The minimum weight of a Roman dominating function on a graph is called the of , denoted by . In this paper, we study the {\it Roman domination number} of generalized Petersen graphs P(n,2) and prove that .
Cite
@article{arxiv.1103.2419,
title = {Roman domination number of Generalized Petersen Graphs P(n,2)},
author = {Haoli Wang and Xirong Xu and Yuansheng Yang and Chunnian Ji},
journal= {arXiv preprint arXiv:1103.2419},
year = {2015}
}
Comments
9 pages