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

Abstract

A Roman\ domination\ function on a graph G=(V, E) is a function f:V(G)→\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))=Σu∈ 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 γR(G). In this paper, we study the Roman domination number of generalized Petersen graphs P(n,2) and prove that γR(P(n,2)) = 8n7 (n ≥ 5).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…