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 .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.