Let be a ring, be the group of all units of , and . In this paper, we investigate for a ring , where is the set of all vertices of the zero-divisor graph of adjacent to . We also investigate the question on zero-divisor graphs posed in the literature such that when the equality holds in a commutative regular ring with identity. Here, is a nonzero idempotent of which is not the identity element of .
24 June 2025 in Hacettepe Journal of Mathematics and Statistics
Let $R$ be a finite commutative ring with nonzero identity. Let $Z^{*}(R)$ be the set of nonzero zero-divisors of $R$. We are dealing with the zero-divisor graph of $R$ which is denoted by $\Gamma(R)$ with vertex set $Z^{*}(R)$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy=0$. The motivation of this study is to compute Wiener index in algebraic graph theory for special type of graph called zero-divisor graph. Wiener index is defined as the sum of all distance between all pairs of vertices in $\Gamma(R)$. In addition, we generalize the Wiener index of the zero-divisor graph in $\mathbb{Z}_p[x]/(x^2)$ for any prime number $p$. We obtain our results and methods by tables and figures.
Let R be a finite commutative ring with identity and let U ( R ) denote its unit group. The unit graph GU ( R ) is the simple graph on the vertex set R in which distinct vertices x , y are adjacent if and only if x + y ∈ U ( R ). A dominating resolving set is a vertex set that dominates the graph and resolves all vertices via distance representations; the minimum cardinality of such a set is the dominant metric dimension, denoted by δ⋆ ( G ). A residue–coset decomposition is developed for finite local rings and is used to obtain sharp dominant‐metric information directly from the quotient map . For every finite local nonfield ring with residue field size and , the exact formula is proved. All minimum dominating resolving sets are characterized: optimality holds if and only if exactly one vertex is omitted from each fiber of , which yields the enumeration .