English

Roman domination number of Generalized Petersen Graphs P(n,2)

Combinatorics 2015-03-19 v1

Abstract

A Roman domination functionRoman\ domination\ function on a graph G=(V,E)G=(V, E) is a function f:V(G){0,1,2}f:V(G)\rightarrow\{0,1,2\} satisfying the condition that every vertex uu with f(u)=0f(u)=0 is adjacent to at least one vertex vv with f(v)=2f(v)=2. The weightweight of a Roman domination function ff is the value f(V(G))=uV(G)f(u)f(V(G))=\sum_{u\in V(G)}f(u). The minimum weight of a Roman dominating function on a graph GG is called the Roman domination numberRoman\ domination\ number of GG, denoted by γR(G)\gamma_{R}(G). In this paper, we study the {\it Roman domination number} of generalized Petersen graphs P(n,2) and prove that γR(P(n,2))=8n7(n5)\gamma_R(P(n,2)) = \lceil {\frac{8n}{7}}\rceil (n \geq 5).

Keywords

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