Metric basis and dimension of barycentric subdivision of zero divisor graphs

Abstract

Let R be a commutative ring with unity 1, and G(V,E) be a simple, connected, nontrivial graph. Let d(a,c) be the distance between the vertices a and c in G. An undirected zero divisor graph of a ring R is denoted by (R) = (V((R)), E((R))), where the vertex set V((R)) consists of all the non-zero zero-divisors of R, and the edge set E((R)) is defined as follows: E((R)) = \e = a1a2 | a1 · a2 = 0 \& a1, a2 ∈ V((R))\. In this article, we consider the zero divisor graph of a group of integers modulo \(n\), denoted as \((Zn)\), where \(n=pq\). Here, \(p\) and \(q\) are distinct primes, with \(q > p\). We aim to determine the metric dimension of the barycentric subdivision of the zero divisor graph \((Zn)\), denoted by \(dim(BS((Zn)))\), and we also prove that \(dim(BS((Zn)))≥ q-2\) for every \(n=pq\), where \(p\) and \(q\) are distinct primes and q>p.

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…