Fault-tolerant metric basis and dimension of barycentric subdivision of zero divisor graphs
Abstract
The undirected zero divisor graph of a commutative ring with unity \( R \), denoted by \( (R) = (V((R)), E((R))) \). The vertex set \( V((R)) \) consists of all the non-zero zero-divisors of \( R \). The edge set \( E((R)) \) is defined by the set \( \ e = a1 a2 a1 · a2 = 0 and a1, a2 ∈ V((R)) \ \). The barycentric subdivision of is the process of subdividing each edge by inserting new vertex in the graph . In this article, we have focused on the fault-tolerant metric dimension of the barycentric subdivision of zero divisor graph of the group of integers modulo \( n \), represented by \( fdim(BS((Zn )\), where \( n = pq \); \( p \) and \( q \) are distinct odd primes with \( q > p \). We also demonstrate that \( fdim(BS((Zn) ≥ q - 1 \) for every \( n = pq \), where \( p \) and \( q \) are any distinct odd primes with \( q > p \).
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.