Search arXiv⌕ Search

arXiv · 2603.19666

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 = a_1 a_2 \mid a_1 \cdot a_2 = 0 \text{ and } a_1, a_2 \in 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(Γ(\mathbb{Z}_n )\), where \( n = pq \); \( p \) and \( q \) are distinct odd primes with \( q > p \). We also demonstrate that \( fdim(BS(Γ(\mathbb{Z}_n) \geq q - 1 \) for every \( n = pq \), where \( p \) and \( q \) are any distinct odd primes with \( q > p \).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vidya S, Sunny Kumar Sharma, Prasanna Poojary, Vadiraja Bhatta G R. 2026-03-20. Fault-tolerant metric basis and dimension of barycentric subdivision of zero divisor graphs. https://arxiv.org/abs/2603.19666

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗