Search arXivSearch

arXiv · 2602.11816

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 = a_1a_2$ $ |$ $ a_1 \cdot a_2 = 0$ $\&$ $ a_1, a_2 \in V(Γ(R))\}$. In this article, we consider the zero divisor graph of a group of integers modulo \(n\), denoted as \(Γ(\mathbb{Z}_n)\), 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 \(Γ(\mathbb{Z}_n)\), denoted by \(dim(BS(Γ(\mathbb{Z}_n)))\), and we also prove that \(dim(BS(Γ(\mathbb{Z}_n)))\geq q-2\) for every \(n=pq\), where \(p\) and \(q\) are distinct primes and $q>p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Vidya, Sunny Kumar Sharma, Prasanna Poojary, Omaima Alshanqiti, G. R. Vadiraja Bhatta. 2026-02-12. Metric basis and dimension of barycentric subdivision of zero divisor graphs. https://arxiv.org/abs/2602.11816

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO