Metric Bases of Barycentric and Matching Subdivisions of Zero-Divisor Graphs

RESUMO

In this paper, we study metric bases and related metric properties for barycentric and partial matching subdivisions of the zero-divisor graph of $\mathbb Z_{pq}$, where $p$ and $q$ are distinct odd primes with $q>p$. We first recall the natural partition of the zero-divisor graph into the two prime classes and then give a detailed characterization of those subsets of $BS(\Gamma(\mathbb Z_{pq}))$ that form metric bases when $q\geq 2p-1$. The proof is expanded by separating the role of closed neighborhoods, rows of subdivision vertices, and forbidden twin configurations. We then investigate $M$-subdivision graphs obtained by subdividing selected edges of $\Gamma(\mathbb Z_{pq})$. In addition to the lower bounds for subdivisions of $p-3$ and $p-2$ edges, we prove an exact formula for matching subdivisions of arbitrary size $r$, $0\leq r\leq p-2$, namely $\dim(G_r)=p+q-r-4$. Several consequences are included to illustrate how a small matching subdivision can reduce the localization cost of the original zero-divisor network.