English

Roman domination number of zero-divisor graphs over commutative rings

Combinatorics 2024-12-11 v1

Abstract

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

Keywords

Cite

@article{arxiv.2412.07510,
  title  = {Roman domination number of zero-divisor graphs over commutative rings},
  author = {Ravindra Kumar and Om Prakash},
  journal= {arXiv preprint arXiv:2412.07510},
  year   = {2024}
}

Comments

9