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

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

2011-03-12

arxiv.org/abs/1103.2419v1

Mathematics

Combinatorics

9 pages

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Roman domination number of Generalized Petersen Graphs P(n,2) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Roman domination number of Generalized Petersen Graphs P(n,2), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Roman domination number of Generalized Petersen Graphs P(n,2) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278716