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

preprint2011arXivOpen access

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))=∑u∈V(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)γ_{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⌉(n≥5)γ_R(P(n,2)) = \lceil {\frac{8n}{7}}\rceil (n \geq 5).

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.