Roman domination number of zero-divisor graphs over commutative rings

Abstract

For a graph G= (V, E), a Roman dominating function is a map f : V → \0, 1, 2\ satisfies the property that if f(v) = 0, then v must have adjacent to at least one vertex u such that f(u)= 2. The weight of a Roman dominating function f is the value f(V)= u ∈ V f(u), and the minimum weight of a Roman dominating function on G is called the Roman domination number of G, denoted by γR(G). The main focus of this paper is to study the Roman domination number of zero-divisor graph (R) and find the bounds of the Roman domination number of T((R)).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…