Exploring Ring Structures: Multiset Dimension Analysis in Compressed Zero-Divisor Graphs

Abstract

This paper explores the concept of multiset dimensions (Mdim) of compressed zero-divisor graphs (CZDGs) associated with rings. The authors investigate the interplay between the ring-theoretic properties of a ring $R$ and the associated compressed zero-divisor graph. An undirected graph consisting of a vertex set $Z\left(R_E\right)\backslash \left\{\right[0\left]\right\}=R_E\backslash \left\{\right[0],[1\left]\right\}$, where $R_E=\left\{\right[x] :x\in R\}$ and $\left[x\right]=\{y\in R : ann(x)=ann(y\left)\right\}$ is called a compressed zero-divisor graph, denoted by ${\Gamma }_E\left(R\right)$. An edge is formed between two vertices $\left[x\right]$ and $\left[y\right]$ of $Z\left(R_E\right)$ if and only if $\left[x\right]\left[y\right]=\left[xy\right]=\left[0\right],$ that is, iff $xy=0$. For a ring $R$, graph $G$ is said to be realizable as ${\Gamma }_E\left(R\right)$ if $G$ is isomorphic to ${\Gamma }_E\left(R\right)$. We classify the rings based on Mdim of their associated CZDGs and obtain the bounds for the Mdim of the compressed zero-divisor graphs. We also study the Mdim of realizable graphs of rings. Moreover, some examples are provided to support our results. Notably, we discuss the interconnection between Mdim, girth, and diameter of CZDGs, elucidating their symmetrical significance.

1. Introduction

Graph theory finds diverse applications across various fields, including modeling social network interactions, and optimizing transportation routes. It aids in ensuring data flow and connectivity in computer networks and enhances the understanding and design of electrical circuits [1,2,3,4,5,6]. In biology, graphs depict protein interactions and genetic patterns, while epidemiology employs them to track disease spread [7,8,9]. Additionally, recommendation systems use graphs to suggest products online, and game theory benefits from graph analysis in strategic scenarios [10,11,12]. Algebraic graph theory explores relationships between graphs and algebraic structures, addressing problems like maximal cliques and minimal spanning trees [13,14,15,16,17]. Coding theory combines algebraic codes and graphs to rectify data transmission errors, while representation theory and homological algebra investigate connections between algebraic structures and graphs [18,19,20]. This interplay between graph theory and algebra is crucial in various theoretical and practical contexts.

Beck [7] proposed the connection between graph theory and algebra by introducing a zero-divisor graph (ZD-graph) of a commutative ring $R$. The author’s [7] primary focus was on the coloring of nodes in a graph, specifically on the ring elements that corresponded to these nodes. Note that a zero vertex is linked to all other vertices in this case. Let the set of zero divisors (ZDs) be denoted by $Z\left(R\right)$ for a commutative ring, and the set of non-zero ZDs of a commutative ring with $1\ne 0$ is denoted by $Z^{*}\left(R\right)=Z\left(R\right)\backslash \left\{0\right\}$. In [3], Anderson and Livingston conducted a study on a ZD-graph in which each node represents a nonzero ZD. Let $x,y\in Z^{*}\left(R\right)$, then an undirected graph obtained by considering $x$ and $y$ as vertices forming an edge iff $xy=0$ is called a ZD-graph of $R,$ denoted $\Gamma \left(R\right)$. The study of Anderson and Livingston emphasizes the case of finite rings, as finite graphs can be obtained when $R$ is finite. Their task was to determine whether a graph is complete for a given ring or a star for a given ring. This ZD-graph definition differs slightly from Beck’s ZD-graph definition for $R$. Remember, zero is not considered as a vertex of the ZD-graph in this case. The study of the ZD-graph has been extinct in recent years, and the idea has been explored, which leads us to the new form of ZD-graphs that includes ideal-based ZD-graphs and module-based ZD-graphs [15,20,21]. Redmond [22] expanded the ZD-graph idea from unital commutative rings to noncommutative rings. Different methods were presented by him to characterize the ZD-graph related to a noncommutative ring, encompassing both undirected and directed graphs [23]. Redmond extended this work using a ZD-graph for a commutative ring and transformed it into an ideal-based ZD-graph. The aim was to generalize the method by substituting elements with zero products with elements whose product belongs to a particular ideal $I$ of ring $R$.

Mulay’s [16] work inspired us to study the ZD-graph obtained by considering equivalence classes of ZDs of a ring $R$. This type of ZD-graph is called a CZDG, denoted by ${\Gamma }_E\left(R\right)$ [4]. A CZDG is an undirected graph obtained by considering $Z\left(R_E\right)\backslash \left\{\right[0\left]\right\}=R_E\backslash \left\{\right[0],[1\left]\right\}$ as vertex set, and can be constructed by taking the equivalence classes $\left[x\right]=\{y\in R : ann(x)=ann(y\left)\right\}$, for every $x\in R\backslash \left(\right[0]\bigcup [1\left]\right)$ as vertices and an edge is formed between two distinct classes $\left[x\right]$ and $\left[y\right]$ iff $\left[x\right]\left[y\right]=0$, i.e., iff $xy=0$. It is important to note that if two vertices say $x$ and $y,$ are adjacent in $\Gamma \left(R\right),$ then in CZDGs, $\left[x\right]$ and $\left[y\right]$ are adjacent iff $\left[x\right]\ne \left[y\right].$ Clearly, $\left[1\right]=R\backslash Z\left(R\right)$ and $\left[0\right]=\left\{0\right\}$, and also for each $x\in R \backslash \left(\right[0]\cup [1\left]\right), \left[x\right]\subseteq Z\left(R\right)\backslash \left\{0\right\}.$ Readers may study [5] for some interesting results on CZDGs.

We consider an example to understand the concept of ZD-graphs and CZDGs. Let $R={\mathbb{Z}}_{16}$, then the vertex set of $\Gamma \left(R\right)=\{2, 4, 6, 8, 10, 12, 14\}$; Figure 1i shows its ZD-graph. Now, we see $ann\left(2\right)=\left\{8\right\}, ann\left(4\right)=\{4, 8, 12\}, ann\left(6\right)=\left\{8\right\}$, $ann\left(8\right)=\{2, 4, 6, 8, 10, 12, 14\}, ann\left(10\right)=\left\{8\right\}$, $ann\left(12\right)=\{4, 8, 12\}$ and $ann\left(14\right)=\left\{8\right\}$. Hence, the vertex set for ${\Gamma }_E\left(R\right)=\left\{\right[2], [4], [8], [14\left]\right\}$. See Figure 1ii for its CZDG.

The annihilator ideals in the ring correspond to the vertices of the ${\Gamma }_E\left(R\right)$. Also, remember that $diam\left({\Gamma }_E\left(R\right)\right)\le 2,$ and a CZDG is always connected. Also, $diam\left({\Gamma }_E\left(R\right)\right)\le diam\left(\Gamma \right(R\left)\right).$ For the CZDG, $gr\left({\Gamma }_E\left(R\right)\right)\le 3$ whenever the CZDG of $R$ contains a cycle [5]. It can be seen in [4] that ${\Gamma }_E\left(R\right)$ = ${\Gamma }_E\left(S\right)$ if $S$ is a Noetherian or $S$ is a finite commutative ring.

Readers may see [1,2,3] to read many advantages of studying CZDGs over the earlier studied ZD-graph. For example, in any ring $R$ having at least two vertices, there exists no finite regular CZDG [24,25,26]. Further, Spiroff et al. [27] showed that the CZDG of local ring $R$ is isomorphic to a star graph with a minimum of four vertices. (If a ring $R$ has a unique maximal ideal, then it is called a local ring [28]).

Another commutative ringucial aspect to consider is the connection between studying equivalence class graphs. The associated primes of $R$ usually considered distinct vertices in CZDGs. In this paper, all graphs are simple graphs; a commutative ring with unity is denoted by $R,$ and the units set is considered as $U\left(R\right)$ [29]. ${\mathbb{Z}}_n$ denotes the ring of integers modulo $n$ and ${\mathbb{F}}_q$ denotes finite field on $q$ elements. Readers are encouraged to study [11,17,30,31,32,33] for basic definitions of graph theory and [6,13] to study basic definitions of ring theory.

Formally, the graph is an ordered pair $G=\left(V,E\right);$ here, $V$ and $E$ denote vertices and edges set, respectively. A graph’s order and size are defined as the cardinality of nodes and edges set, respectively. The open neighborhood of a node $v$ is written as $N\left(v\right)$, and defined as $\left\{v\in V\left(G\right):vu\in E\left(G\right)\right\}$, while the closed neighborhood of a node $u$ is written as $N\left[u\right]$, and defined as $\left\{u\right\}\cup N\left(u\right)$. The distance between two nodes $u^{\prime }$ and $v^{\prime }$ is denoted by $d\left(u^{\prime },v^{\prime }\right)$ and defined as the length of the shortest path between them, while $d\left(w,e^{\prime }\right)=min\{d\left(w,u^{\prime }\right),d\left(w,v^{\prime }\right)\}$ defines the distance between a node $w$ and the edge $e^{\prime }=u^{\prime }{v}^{\prime }.$

A graph $G$ is a regular graph if for every $r\in V, deg\left(r\right)=c$ for a fixed $c\in Z^{+}$. A complete graph is a graph in which there is a connection between every pair of vertices, and we denote it by $K_m$, where $m$ stands for the number of vertices. A graph is classified as a complete bipartite graph if we can divide its vertices into two distinct sets, $X$ and $Y$, where every node in $X$ is connected to every node in $Y$, and it is usually denoted by $K_{m,n}$, where $\left|X\right|=m$ and $\left|Y\right|=$ n. In a connected graph $G$, when the removal of a vertex results in the formation of two or more components, then it is called a cut vertex.

In [30], the authors have studied the edge metric dimension (EMD) of various graphs. Moreover, the relationship between the metric dimension (MD) and EMD allows for the identification of graphs where these two dimensions are equal, as well as for some other graphs $G$ for which $dim\left(G\right)<{dim}_E\left(G\right) \mathrm{or} {dim}_E\left(G\right)<dim\left(G\right).$ Basically, Kelenc et al. [30] explored the comparison of values $dim\left(G\right)$ and ${dim}_E\left(G\right)$. Recently, a study on metric parameters for ZD-graphs has been done. In 2003, Redmond [23] studied the ideal-based ZD-graph of commutative rings.

Simanjuntak et al. [28] introduced a new variant of metric dimension known as multiset dimension (Mdim), where distances between $v$ and all vertices in a resolving set (RS) $W$ were calculated, including their multiplicities. The Mdim is defined as the minimum cardinality of the RS. Assume $v$ is a node of $G$ and $B\subseteq V\left(G\right),$ then representation for a multiset of $v$ with respect to $B$ is defined as the distance between $v$ and nodes in $B$. This representation is denoted by $r_m\left(B\right).$ For all pairs of distinct nodes $u$ and $v,$ $B$ is called an $m$-resolving set of $G$, if $r_m\left(B\right)\ne r_m\left(B\right)$. The cardinality of an $m$-resolving set is called the multiset basis of the graph $G,$ and the minimum cardinality of the multiset basis is called the multiset dimension of $G$; we denote it by $Mdim\left(G\right),$ and if $G$ does not contain an $m$-resolving set, we write $Mdim\left(G\right)=\infty .$ The key point of this article is that the apparent expansions are an oversimplification of the task of identifying graph vertices using the multiset representation.

Some of the contributions of this article include generalizing the Mdim of CZDGs that accommodates different characterizations of the rings based on vertices in CZDGs. Authors have also proved that rings can be characterized based on their multiset dimensions. Moreover, authors have characterized several rings based on their CZDGs for which multiset dimensions can be bounded by diameter.

The novelty of finding the multiset dimensions of graphs lies in the fact that it is a relatively new concept and has not been extensively studied. It provides a more complete understanding of the graph’s structure and algebraic properties, which can be useful in many applications such as network design, social networking, and communication systems.

Simanjuntak et al. [28] found some sharp bounds for the Mdim of arbitrary graphs in terms of their MD, order, or diameter. For a graph to have finite Mdim, Siamanjuntak provided some necessary conditions, with an example of an infinite family of graphs where those necessary conditions are also sufficient. It was also shown that the Mdim of any graph other than a path is at least three, and two families of graphs having the Mdim three were proved. Here, we consider some results from [28] as follows:

Theorem 1

([28]). For any integer $m\ge 3, n\ge 6,$ $Mdim\left(P_m\right)=1, Mdim\left(k_m\right)=\infty . and Mdim\left(C_n\right)=3.$ Moreover, $Mdim\left(P_m\right)=1$ iff $G\cong P_m$.

Moreover, for a complete bipartite graph $K_{m,n}$, we get different Mdim for different choices of values of $m \mathrm{a}\mathrm{n}\mathrm{d} n.$

Theorem 2

([28]). For any complete bipartite graph $K_{m,n}$, the Mdim$\left(K_{m,n}\right)$ is given below.

$Mdim\left(K_{m,n}\right)=1$	$for m=1 and n=\mathrm{1,2}$
	$for m=2 and n=1$
$Mdim\left(K_{m,n}\right)=\infty$	$for m=1 and n\ge 3$
	f$or m=2 and n\ge 2$

Moreover, Mdim for a single vertex graph $G$ is supposed to be zero and undefined for an empty graph.

2. Multiset Dimension of Some ${\mathit{\Gamma }}_{\mathit{E}}\left(\mathit{R}\right)$

Proposition 1.

Let $R$ be a finite commutative ring. Then, $Mdim\left({\Gamma }_E\left(R\right)\right)=0$ iff $\Gamma \left(R\right)\cong K_n.$

Proof. 

Let $\Gamma \left(R\right)\cong K_n$, then one of the two cases holds; either $R$ is isomorphic to ${\mathbb{Z}}_2\times {\mathbb{Z}}_2$ or for all $x,y\in Z^{*}\left(R\right)$, the product of $x$ and $y$ is zero, i.e., $xy=0$. Let $v_1,v_2,\dots v_n$ be the ZD of the ring $R$ that corresponds to the vertices of the ZD-graph, then $\left[v_1\right]=\left[v_2\right],\cdots =\left[v_n\right]$ suggests that all vertices of the ZD-graph would collapse to a graph with a single vertex in the CZDG, and as we know, Mdim is $0$ for a single vertex graph.

For the converse part, assume that $\Gamma \left(R\right)\ncong K_n$. This suggests the presence of at least one vertex in $\Gamma \left(R\right)$ that is not connected to every other vertex. Consequently, the size of the edge set CZDG is at least $2$, i.e., $\left|{\Gamma }_E\left(R\right)\right| \ge 2$, leading to a multiset dimension $Mdim \left({\Gamma }_E\left(R\right)\right) \ge 1$.

The converse can also be shown by assuming that $Mdim \left({\Gamma }_E\left(R\right)\right)=0$. This implies that ${\Gamma }_E\left(R\right)=\left\{\right[a\left]\right\}$ for some non-zero element say, $a\in Z^{*}\left(R\right)$, indicating that ${\Gamma }_E\left(R\right)$ is a graph with a single vertex. This implies that $\Gamma \left(R\right)$ is either isomorphic to $K_n$, $\forall , n \ge 1$, or a graph with a single vertex. □

Proposition 2.

Let $R$ be a finite commutative ring. Then, $Mdim\left({\Gamma }_E\left(R\right)\right)=1$, iff $\Gamma \left(R\right)\cong K_{m,n}$, $where m or n \ge 2$.

Proof. 

Suppose that the ZD-graph $\Gamma \left(R\right)$ is isomorphic to $K_{m,n}$ having two distance similar classes $V_1$ and $V_2$. Specifically, assume that $V_1=\{u_1,u_2,\cdots ,u_m\}$ and $V_2=\{v_1,v_2,\cdots ,v_n\}$ such that $u_i{v}_j=0$, $\forall i\ne j$. Cleary, an independent set is formed by each of $V_1$ and $V_2$. Furthermore, observing that $\left[u_1\right]=\left[u_2\right]=\cdots =\left[u_m\right]$ and also, $\left[v_1\right]=\left[v_2\right]=\cdots =\left[v_n\right]$, we deduce that both $V_1$ and $V_2$ each represents a single vertex CZDG. Given the connected nature of the graph, we can conclude that ${\Gamma }_E\left(R\right)\cong K_{1,1}$, which can be visualized as a path consisting of two vertices. Therefore, by Theorem 2, it follows that the multiset dimension of the CZDG is 1, that is, $Mdim \left({\Gamma }_E\left(R\right)\right)=1$.  □

Remark 1.

It’s important to note that the converse of Proposition 2 may not hold; however, in cases where $R\cong {\mathbb{Z}}_2\times {\mathbb{Z}}_2$, we find that ${\Gamma }_E\left(R\right)\cong K_{1,1}$, with $Mdim\left({\Gamma }_E\left(R\right)\right)=1$ such that $\Gamma \left(R\right)\cong {\Gamma }_E\left(R\right)$. As demonstrated in ([27], Proposition 1.5), a significant difference between the ZD-graph and CZDG is that the latter cannot be isomorphic to a graph having a minimum of $3$ nodes and is also complete. However, see ([27], Proposition 1.7), if ${\Gamma }_E\left(R\right)$ is isomorphic to a complete r-partite graph, then $r$ must equal $2,$ resulting in ${\Gamma }_E\left(R\right)\cong K_{n,1}$, for some $n\ge 1$. A ring $R$ is classified as a Boolean ring if $a^2=a$ holds for every element $a\in R$. Importantly, a Boolean ring $R$ is both commutative and has a characteristic of $2$ $\left(char\right(R)=2)$. More comprehensively, a commutative ring qualifies as a von Neumann regular ring. When, for any element $a\in R$, there exists an element $b$ within $R$ such that $a=a^{2}b$. This condition is equivalent to $R$ being a zero-dimensional reduced ring, as elucidated in ([13], Theorem 3. Clearly, a Boolean ring can be classified as a von Neumann regular ring, but the converse may not always be true. For instance, consider a family ${\left\{F_i\right\}}_{i\in I}$ of fields, where the product $\prod _{i\in I}{F}_i$ is von Neumann regular ring. Nevertheless, it is Boolean if and only if $F_i\cong {\mathbb{Z}}_2$ holds for all $i\in I$. If $R$ is a reduced ring, then for $r,s\in \Gamma \left(R\right)$, the conditions $N\left(r\right)=N\left(s\right)$ and $\left[r\right]=\left[s\right]$ are equivalent ([13], Lemma 3.1). Furthermore, if $R$ is a von Neumann regular ring, then these conditions are equivalent to $rR=sR$. Moreover, if $R$ is a von Neumann regular ring and $B\left(R\right)$ signifies the set of idempotent elements within $R$, the mapping defined by $e\mapsto \left[e\right]$ forms an isomorphism from the subgraph of $\Gamma \left(R\right)$ induced by $B\left(R\right)\backslash \left\{\mathrm{0,1}\right\}$ onto ${\Gamma }_E\left(R\right)$ ([13], Proposition 4.5). Particularly, if $R$ is a Boolean ring (i.e., $R=B\left(R\right)$), then ${\Gamma }_E\left(R\right)$ is isomorphic to $\Gamma \left(R\right)$. This discourse leads us to the subsequent characterization.

Corollary 1.

Consider $R$ and $S$ bring a reduced commutative ring. If $\Gamma \left(R\right)$ is isomorphic to $\Gamma \left(S\right)$ then ${Mdim(\Gamma }_E\left(R\right))={Mdim(\Gamma }_E\left(S\right))$.

3. Analyzing Bounds for the Multiset Dimension of ${\mathit{\Gamma }}_{\mathit{E}}\left(\mathit{R}\right)$

Here, we explore the importance of calculating Mdim in studying CZDGs. Additionally, we determine the Mdim of certain specialized ring types that correspond to ${\Gamma }_E\left(R\right)$. Notably, a recent contribution by Pirzada et al. [18] presented a work on the characterization of $\Gamma \left(R\right)$ in cases where the md is finite and cases where it remains undefined ([18], Theorem 3.1).

Theorem 3.

Let R be a finite commutative ring with unity. Then, ${Mdim(\Gamma }_E\left(R\right))$ is undefined iff $R$ is an integral domain.

Proof. 

As we know that ${\Gamma }_E\left(R\right)$ is not defined if $R$ is an integral domain, it follows that ${Mdim(\Gamma }_E\left(R\right))$ is undefined and vice versa.

Let us consider the following lemma:

Lemma 1.

Consider a ring $R,$ which is a finite local ring, $\left|R\right|=p^n,$ with $n$ being a positive integer and some prime $p.$

The preceding result will be applied to determine the Mdim of rings $R,$ which are finite local rings.  □

Proposition 3.

Let $\left|R\right|=p^2$ for a local ring $R$ and $p$ being $2, 3 or 5$, then ${Mdim(\Gamma }_E\left(R\right))$ can be either undefined or $0$.

Proof. 

Let us assume all local rings have an order. $p^2$, where $p$ is a prime. The following rings ${\mathbb{F}}_{p^2}, {\mathbb{Z}}_{p^2} \mathrm{a}\mathrm{n}\mathrm{d} {\displaystyle \frac{{\mathbb{F}}_p\left[x\right]}{\left(x^2\right)}}$ are local rings of order $p^2$ ([10], p. 687).

• Case I. If $\mathit{R}\cong {\mathbb{F}}_{{\mathit{p}}^2}$, i.e., $R$ is a field having an order $p^2$. In such cases, the graph ${\Gamma }_E\left(R\right)$ becomes an empty graph, resulting in an undefined $Mdim\left({\Gamma }_E\left(R\right)\right)$.

• Case II. If $\mathit{R}\cong {\mathbb{Z}}_{{\mathit{p}}^2},\mathrm{o}\mathrm{r} \mathit{R}\cong {\displaystyle \frac{{\mathbb{F}}_{\mathit{p}}\left[\mathit{x}\right]}{\left({\mathit{x}}^2\right)}}$, i.e., $\left|R\right|=p^2 \mathrm{and} R$ is not a field. For $p=2, 3, \mathrm{or} 5,$ the graph ${\Gamma }_E\left(R\right)$ consists of a single vertex, leading to $Mdim\left({\Gamma }_E\left(R\right)\right)=0$. This concludes our result.  □

Example 1.

Consider the ring $R\cong {\mathbb{Z}}_8$, then it is easy to see that $\Gamma \left(R\right) \cong P_3 and {\Gamma }_E\left(R\right)\cong P_2$. Hence by Theorem 1, $Mdim\left(\Gamma \right(R\left)\right)=1={Mdim(\Gamma }_E\left(R\right))$.

Proposition 4.

Let $R$ be a local ring having order (i.e., $R$ is not a field)

• 1. 

  $p=8 or 27,$ then ${Mdim(\Gamma }_E\left(R\right))=0$, and ${Mdim(\Gamma }_E\left(R\right))=1$ only if $R\cong {\mathbb{Z}}_8, {\mathbb{Z}}_{27}, {\mathbb{Z}}_2\left[x\right]/\left(x^3\right), {\mathbb{Z}}_3\left[x\right]/\left(x^3\right)$, ${\mathbb{Z}}_4\left[x\right]/(2x,x^2-2), {\mathbb{Z}}_9\left[x\right]/({3x,x}^2-3),{\mathbb{Z}}_9\left[x\right]/({3x,x}^2-6)$.

• 2. 

  $p=4$, then ${Mdim(\Gamma }_E\left(R\right))$ is equal to $0, 1,$ or $\mathrm{\infty }$.

Proof. 

(a) The following rings, ${\mathbb{F}}_{p^3},{\displaystyle \frac{{\mathbb{F}}_p\left[x\right]}{\left(x^3\right)}},{\displaystyle \frac{{\mathbb{F}}_p[x,y]}{{(x,y)}^2}},{\displaystyle \frac{{\mathbb{Z}}_{p^2}\left[x\right]}{{(px,x}^2)}},{\displaystyle \frac{{\mathbb{Z}}_{p^2}\left[x\right]}{{(px,x}^2-p)}}$, are all local rings having an order $p^3$.

• Case (i). When $p=2$, the local rings ${\displaystyle \frac{{\mathbb{Z}}_2[x, y]}{{(x,y)}^2}}$ and ${\displaystyle \frac{{\mathbb{Z}}_4\left[x\right]}{{(2x, x}^2)}}$ have the same equivalence classes of zero divisors. Let us assume that $\left[m\right]=\{x,y,x+y\}$ is equivalence class for any ZD $m$ of ring ${\displaystyle \frac{{\mathbb{Z}}_2[x, y]}{{(x,y)}^2}}$ and $\left[n\right]=\{2,x,x+2\}$ is equivalence class for any ZD $m$ ring ${\displaystyle \frac{{\mathbb{Z}}_4\left[x\right]}{{(2x, x}^2)}}$, i.e., ${\Gamma }_E\left(R\right)$ is a single vertex graph. Hence, ${Mdim(\Gamma }_E\left(R\right))=0$. But ${\Gamma }_E\left(R\right)\cong P_2$ for ${\mathbb{Z}}_8, {\mathbb{Z}}_2\left[x\right]/\left(x^3\right), {\mathbb{Z}}_4\left[x\right]/(2x, x^2-2).$ Hence by Theorem 1 ${Mdim(\Gamma }_E\left(R\right))=1.$

• Case (ii). If $p=3$ for the above-given rings, we find that the CZDG structures of the rings ${\mathbb{Z}}_{27}, {\mathbb{Z}}_3\left[x\right]/\left(x^3\right), {\mathbb{Z}}_9\left[x\right]/({3x, x}^2-3), {\mathbb{Z}}_9\left[x\right]/({3x, x}^2-6)$ are the same and isomorphic to $P_2$. Then, by Theorem 1 ${Mdim(\Gamma }_E\left(R\right))=1.$

Also, the rings ${\displaystyle \frac{{\mathbb{Z}}_{3^2}\left[x\right]}{\left({3x,x}^2\right)}}$ and ${\displaystyle \frac{{\mathbb{Z}}_3[x,y]}{{(x,y)}^2}}$ have the same equivalence classes of ZDs given by $\left[m\right]=\{3,6,x,2x,x+3,x+6,2x+3,2x+6\}$ for any ZD $m$ of ring ${\displaystyle \frac{{\mathbb{Z}}_{3^2}\left[x\right]}{\left({3x,x}^2\right)}}$ and $\left[n\right]=\{x,2x,y,2y,x+y,2x+y,x+2y,2x+2y\}$ for any ZD $n$ of ring ${\displaystyle \frac{{\mathbb{Z}}_3[x,y]}{{(x,y)}^2}}$, i.e., ${\Gamma }_E\left(R\right)$ is a graph with a single vertex. Hence, ${Mdim(\Gamma }_E\left(R\right))=0$.

(b) Now we focus our attention to local rings having order $p^4$ by taking $p=2$. It is found in [10] that there are 21 non-isomorphic commutative local rings with an identity of order $16.$ The following rings with ${Mdim(\Gamma }_E\left(R\right))=0$ are ${{\mathbb{F}}_4\left[x\right]/\left(x^2\right), \mathbb{Z}}_2[x, y, z]/{(x, y, z)}^2$, and ${\mathbb{Z}}_4\left[x\right]/(x^2+x+1).$ The following are the rings having ${Mdim(\Gamma }_E\left(R\right))=1$, ${\mathbb{Z}}_2\left[x\right]/\left(x^4\right)$, ${\mathbb{Z}}_2[x, y]/(x^3, xy, x^2)$, ${\mathbb{Z}}_4\left[x\right]/(2x, x^3-2)$, ${\mathbb{Z}}_4\left[x\right]/(x^2-2)$, ${\mathbb{Z}}_8\left[x\right]/(2x, x^2)$, ${\mathbb{Z}}_{16}$, ${\mathbb{Z}}_4\left[x\right]/(x^2-2x-2)$, ${\mathbb{Z}}_8\left[x\right]/(2x, x^2-2)$, and ${\mathbb{Z}}_4\left[x\right]/(x^2-2x)$.

Furthermore, the following rings ${\mathbb{Z}}_4\left[x\right]/\left(x^2\right)$, ${\mathbb{Z}}_2[x,y]/(x^2,y^2)$ and ${\mathbb{Z}}_2[x,y]/(x^2{-y}^2,xy)$ have ${Mdim(\Gamma }_E\left(R\right))=\mathrm{\infty }.$  □

Now, we will find ${Mdim(\Gamma }_E\left({\mathbb{Z}}_n\right))$.

Proposition 5.

Consider a prime number $p$.

• (a) 

  When $n=2p$ and $p>2$, then ${Mdim(\Gamma }_E\left({\mathbb{Z}}_n\right))=1$.

• (b) 

  When $n=p^2$, then ${Mdim(\Gamma }_E\left({\mathbb{Z}}_n\right))=0$.

Proof. 

(a) When $p=2$, the CZDG of ${\mathbb{Z}}_4$ is a single vertex graph, hence ${Mdim(\Gamma }_E\left({\mathbb{Z}}_4\right))=0$.

Consider $p>2$, then $\{2, 2.2, 2.3,\dots ,2.(p-1), p\}$ is a ZD set of ${\mathbb{Z}}_n$. Given that the $Char \left({\mathbb{Z}}_n\right)=2p$, we can deduce that $p$ is adjacent to every other vertex. Consequently, the equivalence classes of these ZDs are as follows:

$\left[2\right]=\left[2.2\right]=\dots =[2.(p-1\left)\right]=\left\{p\right\}, \left[p\right]=\{2, 2.2, 2.3, \dots , 2.(P-1\left)\right\}.$

Thus, $\left\{\right[p],[2x\left]\right\}$ is a vertex set of ${{\Gamma }_E(\mathbb{Z}}_n)$, for some positive integer $x=1,2,3,\dots ,p-1.$ So ${{\Gamma }_E(\mathbb{Z}}_n)\cong P_2$, then by Theorem 1 ${Mdim(\Gamma }_E\left(R\right))=1$.

(b) A ZD set of ${\mathbb{Z}}_n$ is $\{p, p.2, p.3,\dots ,p.(p-1\left)\right\}$, when $n=p^2 \mathrm{and} p>2$. Since $Char \left({\mathbb{Z}}_n\right)=p^2$, so equivalence classes of all are the same, i.e., $\{p, p.2, p.3,\dots ,p.(p-1\left)\right\}$. Hence the CZDG of ${\mathbb{Z}}_n$ is a single vertex graph, so ${Mdim(\Gamma }_E\left(R\right))=0.$

Consider a ring $R$, a graph $G$ is said to be realizable as ${\Gamma }_E\left(R\right)$ if $G\cong {\Gamma }_E\left(R\right)$. However, numerous results suggest that the majority of graphs cannot be realized as ${\Gamma }_E\left(R\right),$ For instance, ${\Gamma }_E\left(R\right)$ cannot represent a complete graph with three or more vertices or a cycle graph.  □

Proposition 6.

Consider a realizable graph ${\Gamma }_E\left(R\right)$ containing three vertices, then ${Mdim(\Gamma }_E\left(R\right))=1$.

Proof. 

In a study by Spiroff et al. [27], it was established that one realizable graph denoted by ${\Gamma }_E\left(R\right)$ encompassing precisely three vertices as a graph representing equivalence classes of zero-divisors for a given ring $R$ is isomorphic to the path graph $P_3$, see Figure 2. Understandably, its Mdim is $1$.  □

Proposition 7.

Consider a realizable graph ${\Gamma }_E\left(R\right)$ containing four vertices, then ${Mdim(\Gamma }_E\left(R\right))$ is either ∞ or 1.

Proof. 

The possible realizable graph ${\Gamma }_E\left(R\right)$ with four vertices are illustrated in Figure 3. It is readily apparent that their Mdim can be either ∞ or $1$.  □

Proposition 8.

Consider a realizable graph ${\Gamma }_E\left(R\right)$ with five vertices, then ${Mdim(\Gamma }_E\left(R\right))=\infty$.

Proof. 

The possible realizable graph ${\Gamma }_E\left(R\right)$ with five vertices is illustrated in Figure 4; it is readily apparent that their Mdim is ∞.  □

4. Relationship between Multiset Dimension, Diameter, and Girth of ${\mathit{\Gamma }}_{\mathit{E}}\left(\mathit{R}\right)$

Within this section, we delve into the correlation among multiset dimensions, diameter, and girth of ${\Gamma }_E\left(R\right)$. Since $gr\left({\Gamma }_E\left(R\right)\right)\in \{3,\mathit{\infty }\}$, but $gr\left({\Gamma }_E\left(R\right)\right)=3$ iff $gr\left(\Gamma \right(R\left)\right)=3$, where $R$ is a reduced commutative ring. Moreover, $gr\left({\Gamma }_E\left(R\right)\right)=\infty ⟺gr\left(\Gamma \right(R\left)\right)\in \{4,\mathit{\infty }\}$. Nevertheless, it is possible that $gr\left(\Gamma \right(R\left)\right)=3$ and we could have either $gr\left({\Gamma }_E\left(R\right)\right)=3 \mathrm{o}\mathrm{r} \infty$. In the subsequent result, we establish the ${Mdim(\Gamma }_E\left(R\right))$ of a ring $R$ in terms of $gr({\Gamma }_E\left(R\right)$.

Theorem 4.

Consider a finite commutative ring $R$ such that $gr\left({\Gamma }_E\left(R\right)\right)=\infty$.

• (i) 

  Then, $Mdim\left({\Gamma }_E\left(R\right)\right)=1,$ if $R$ is a reduced ring,

• (ii) 

  Then, $Mdim\left({\Gamma }_E\left(R\right)\right)=0,$ if $R\cong {\mathbb{Z}}_4, {\mathbb{Z}}_9, {\mathbb{Z}}_2\left[x\right]/\left(x^2\right)$.

Proof. 

(a) Let us consider that $R$ is a reduced ring and not isomorphic to ${\mathbb{Z}}_2\times {\mathbb{Z}}_2$, then it is certain that $R$ cannot be isomorphic to ${\mathbb{Z}}_2\times A$, where $A$ is some finite field. Consequently, $R$ possesses two equivalence classes of ZDs $\left[\right(1,0\left)\right] \mathrm{a}\mathrm{n}\mathrm{d} \left[\right(0,1\left)\right],$ which are adjacent to each other (by Theorem 2 [29]). As a result, $Mdim\left({\Gamma }_E\left(R\right)\right)=1$. However, if $R$ is isomorphic to ${\mathbb{Z}}_2\times {\mathbb{Z}}_2$, suggesting that $R$ is a Boolean ring. It follows that $\Gamma \left(R\right)$ is isomorphic to ${\Gamma }_E\left(R\right)$. Consequently, the result is completed by using (Lemma 3, [29]).

(b) For the rings listed as follows: $R\cong {\mathbb{Z}}_4, {\mathbb{Z}}_9, {\mathbb{Z}}_2\left[x\right]/\left(x^2\right)$, their CZDG, ${\Gamma }_E\left(R\right)$ represents a single vertex graph and hence $Mdim\left({\Gamma }_E\left(R\right)\right)=0.$  □

Corollary 2.

Let $R$ be a finite commutative ring having unity one and $\mathbb{F}$ be a finite field. Also, let $R$ be a local ring isomorphic to any of the following listed rings: ${\mathbb{Z}}_8, {\mathbb{Z}}_{27}, {\mathbb{Z}}_2\left[x\right]/\left(x^3\right), {\mathbb{Z}}_4\left[x\right]/(2x,x^2-2)$, ${\mathbb{Z}}_2[x,y]/(x^3,xy,y^2)$, ${\mathbb{Z}}_8\left[x\right]/(2x,x^2), {\mathbb{Z}}_4\left[x\right]/(x^3,2x^2,2x)$, ${\mathbb{Z}}_9\left[x\right]/(3x,x^2-6), {\mathbb{Z}}_9\left[x\right]/(3x,x^2-3)$, ${\mathbb{Z}}_3\left[x\right]/\left(x^3\right).$ If $gr\left({\Gamma }_E\left(R\right)\right)=\infty$, then for reduced rings $R\times \mathbb{F}$, ${\Gamma }_E\left(R\times \mathbb{F}\right)\cong {\Gamma }_E\left(R\right)$ with Mdim $1$.

Proof. 

Let $gr\left({\Gamma }_E\left(R\right)\right)=\infty$, then for all reduced rings $R\times \mathbb{F}$, we have ${\Gamma }_E\left(R\times \mathbb{F}\right)\cong K_{1,1}$ (Lemma 3, [29]). Furthermore, the above local rings list have the same CZDG isomorphic to $k_{1,1}$. Hence $Mdim\left({\Gamma }_E\left(R\right)\right)=1$ for the above local rings.  □

We now focus on examining the connection between multiset dimension and diameter of CZDGs. Considering, $diam \left({\Gamma }_E\left(R\right)\right)\le 3,$ when there is a cycle in CZDG, the following outcomes emerge:

Theorem 5.

Let $R$ be a commutative ring and ${\mathbb{F}}_1$ and ${\mathbb{F}}_2$ are fields. Then,

• (a) 

  $Mdim\left({\Gamma }_E\left(R\right)\right)=diam\left({\Gamma }_E\left(R\right)\right)=1 \mathit{if} R\cong {\mathbb{F}}_1\times {\mathbb{F}}_2$.

• (b) 

  $Mdim\left({\Gamma }_E\left(R\right)\right)=0⟺diam\left({\Gamma }_E\left(R\right)\right)=0$.

• (c) 

  $Mdim\left({\Gamma }_E\left(R\right)\right)=0$ if $Z{\left(R\right)}^2=0$ and $\left|Z\left(R\right)\right|\ge 2.$

• (d) 

  $Mdim\left({\Gamma }_E\left(R\right)\right)=0⟺diam\left(\Gamma \left(R\right)\right)=0 or 1, R\ncong {\mathbb{Z}}_2\times {\mathbb{Z}}_2.$

Proof. 

• (a). Let $R\cong {\mathbb{F}}_1\times {\mathbb{F}}_2,$ then $\left|{\Gamma }_E\left(R\right)\right|=2$ (by Lemma 3, [29]). Since the only equivalence classes of ZDs are $\left[\right(\mathrm{0,1}\left)\right]$ and $\left[\right(\mathrm{1,0}\left)\right]$, CZDG is isomorphic to $K_{1,1}.$ Hence, $Mdim\left({\Gamma }_E\left(R\right)\right)=1=diam \left({\Gamma }_E\left(R\right)\right)$.

• (b). $Mdim\left({\Gamma }_E\left(R\right)\right)=0$ iff ${\Gamma }_E\left(R\right)$ is a single vertex graph, and it is possible iff $diam \left({\Gamma }_E\left(R\right)\right)=0$.

• (c). Let $\left|Z\left(R\right)\right|\ge 2$ and $Z{\left(R\right)}^2=0$. Hence $ann\left(a\right)=ann\left(b\right),$ for each $a, b\in Z{\left(R\right)}^{*}.$ This suggests that $diam \left({\Gamma }_E\left(R\right)\right)=0$. Therefore $Mdim\left({\Gamma }_E\left(R\right)\right)=0$.

• (d). Assume that $diam\left(\Gamma \left(R\right)\right)=0 \mathrm{or} 1$, subsequently $\Gamma \left(R\right)\cong k_n$, thus $Mdim\left({\Gamma }_E\left(R\right)\right)=0$ except if $R\ncong {\mathbb{Z}}_2\times {\mathbb{Z}}_2.$ Conversely, assume that $Mdim\left({\Gamma }_E\left(R\right)\right)=0.$ Then $\Gamma \left(R\right)\cong k_n$, hence $diam\left(\Gamma \left(R\right)\right)=0 \mathrm{or} 1.$  □

5. Conclusions

The rings have been characterized by studying the multiset dimensions of their associated CZDGs. We found some bounds for the multiset dimensions of CZDGs. We also studied the Mdim of the graph $G,$ which is realizable as ${\Gamma }_E\left(R\right)$. The study concluded by discussing the connection between multiset dimension, diameter, and girth of ${\Gamma }_E\left(R\right)$. In the future, Mdim can be studied to characterize the rings based on their other types of ZD-graphs.

Author Contributions

Conceptualization, writing—original draft preparation, N.A.; methodology, H.M.A.S.; Review and editing, J.A.; validation, M.I.Q.; formal analysis, A.A. (Albandary Almahri); investigation, resources, S.A.O.A.; writing—review and editing, A.A. (Ali Akgül). All authors have read and agreed to the published version of the manuscript.

Data Availability Statement

The data supporting the findings of this study are available within the manuscript. Furthermore, the preprint version of this manuscript can be accessed on arXiv at the following link: https://arxiv.org/abs/2405.06187, accessed on 10 May 2024.

Acknowledgments

The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through the Large Groups Project under grant number (project number RGP. 2/449/44 Academic year 1444H).

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Figures

Figure 1. Zero divisor and Compressed Zero divisor graphs. (i) Zero divisor graph of ring [Forumla omitted. See PDF.], (ii) Compressed zero divisor graph of [Forumla omitted. See PDF.].

Figure 2. [Forumla omitted. See PDF.].

Figure 3. [Forumla omitted. See PDF.].

Figure 4. [Forumla omitted. See PDF.].

References

1. Akbari, S.; Mohammadian, A. On zero divisor graphs of a ring. J. Algebra; 2004; 274, pp. 847-855. [DOI: https://dx.doi.org/10.1016/S0021-8693(03)00435-6]

2. Anderson, D.D.; Naseer, M. Beck’s coloring of a commutative ring. J. Algebra; 1993; 159, pp. 500-514. [DOI: https://dx.doi.org/10.1006/jabr.1993.1171]

3. DAnderson, F.; Livingston, P.S. The zero divisor graph of a commutative ring. J. Algebra; 1999; 217, pp. 434-447. [DOI: https://dx.doi.org/10.1006/jabr.1998.7840]

4. Anderson, D.F.; LaGrange, J.D. Commutative Boolean Monoids, reduced rings and the compressed zero-divisor graphs. J. Pure Appl. Algebra; 2012; 216, pp. 1626-1636. [DOI: https://dx.doi.org/10.1016/j.jpaa.2011.12.002]

5. Anderson, D.F.; LaGrange, J.D. Some remarks on the compressed zero-divisor graphs. J. Algebra; 2016; 447, pp. 297-321. [DOI: https://dx.doi.org/10.1016/j.jalgebra.2015.08.021]

6. Atiyah, M.F.; MacDonald, I.G. Introduction to Commutative Algebra; Addison-Wesley: Reading, MA, USA, 1969.

7. Beck, I. Coloring of commutative rings. J. Algebra; 1988; 26, pp. 208-226. [DOI: https://dx.doi.org/10.1016/0021-8693(88)90202-5]

8. Ali, N.; Kousar, Z.; Safdar, M.; Tolasa, F.T.; Suleiman, E. Mapping Connectivity Patterns: Degree-Based Topological Indices of Corona Product Graphs. J. Appl. Math.; 2023; 2023, 8975497. [DOI: https://dx.doi.org/10.1155/2023/8975497]

9. Ali, N.; Siddiqui HM, A.; Qureshi, M.I. On Certain Bounds for Multiset Dimensions of Zero-Divisor Graphs Associated with Rings. arXiv; 2024; arXiv: 2405.06180

10. Corbas, B.; Williams, G.D. Rings of order p5 Part II. Local rings. J. Algebra; 2000; 231, pp. 691-704. [DOI: https://dx.doi.org/10.1006/jabr.2000.8350]

11. Diestel, R. Graph Theory; 4th ed. Vol. 173 of Graduate texts in mathematics Springer: Berlin/Heidelberg, Germany, 2010.

12. Harary, F.; Melter, R.A. On the metric dimension of a graph. Ars Combin.; 1976; 2, pp. 191-195.

13. Huckaba, J.A. Commutative Rings with Zero Divisors; Marcel-Dekker: New York, NY, USA, Basel, Switzerland, 1988.

14. Khuller, S.; Raghavachari, B.; Rosenfeld, A. Localization in Graphs; Technical Report CS-TR-3326 University of Maryland at College Park: College Park, MD, USA, 1994.

15. Maimani, H.R.; Pournaki, M.R.; Yassemi, S. Zero divisor graph with respect to an ideal. Comm. Algebra; 2006; 34, pp. 923-929. [DOI: https://dx.doi.org/10.1080/00927870500441858]

16. Mulay, S.B. Cycles and symmetries of zero-divisors. Comm. Algebra; 2002; 30, pp. 3533-3558. [DOI: https://dx.doi.org/10.1081/AGB-120004502]

17. Pirzada, S. An Introduction to Graph Theory; Orient Blackswan: Hyderabad, India, 2012.

18. Pirzada,; Raja, R.; Redmond, S.P. Locating sets and numbers of graphs associated to commutative rings. J. Algebra Appl.; 2014; 13, 1450047. [DOI: https://dx.doi.org/10.1142/S0219498814500479]

19. Pirzada, S.; Raja, R. On the metric dimension of a zero divisor graph. Comm. Algebra; 2017; 45, pp. 1399-1408. [DOI: https://dx.doi.org/10.1080/00927872.2016.1175602]

20. Pirzada, S.; Raja, R. On graphs associated with modules over commutative rings. J. Korean Math. Soc.; 2016; 53, pp. 1167-1182. [DOI: https://dx.doi.org/10.4134/JKMS.j150457]

21. Raja, R.; Pirzada, S.; Redmond, S. On locating numbers and codes of zero divisor graphs associated with commutative rings. J. Algebra Appl.; 2016; 15, 1650014. [DOI: https://dx.doi.org/10.1142/S0219498816500146]

22. Redmond, S.P. On zero divisor graph of small finite commutative rings. Disc. Math.; 2007; 307, pp. 1155-1166. [DOI: https://dx.doi.org/10.1016/j.disc.2006.07.025]

23. Redmond, S.P. An Ideal based zero divisor graph of a commutative ring. Comm. Algebra; 2003; 31, pp. 4425-4443. [DOI: https://dx.doi.org/10.1081/AGB-120022801]

24. Sebo, A.; Tannier, E. On metric generators of graphs. Math. Oper. Res.; 2004; 29, pp. 383-393.

25. Slater, P.J. Dominating and reference sets in a graph. J. Math. Phys. Sci.; 1988; 22, pp. 445-455.

26. Alali, A.S.; Ali, S.; Hassan, N.; Mahnashi, A.M.; Shang, Y.; Assiry, A. Algebraic Structure Graphs over the Commutative Ring Z m: Exploring Topological Indices and Entropies Using M-Polynomials. Mathematics; 2023; 11, 3833. [DOI: https://dx.doi.org/10.3390/math11183833]

27. Spiroff, S.; Wickham, C. A zero divisor graph determined by equivalence classes of zero divisors. Comm. Algebra; 2011; 39, pp. 2338-2348. [DOI: https://dx.doi.org/10.1080/00927872.2010.488675]

28. Simanjuntak, R.; Siagian, P.; Vetrik, T. The multiset dimension of graphs. arXiv; 2017; arXiv: 1711.00225

29. Pirzada, S.; Bhat, M.I. Computing metric dimension of compressed zero divisor graphs associated to rings. Acta Univ. Sapientiae Math.; 2018; 10, pp. 298-318. [DOI: https://dx.doi.org/10.2478/ausm-2018-0023]

30. Kelenc, A.; Tratnik, N.; Yero, I.G. Uniquely identifying the edges of a graph: The edge metric dimension. Discret. Appl. Math.; 2018; 251, pp. 204-220. [DOI: https://dx.doi.org/10.1016/j.dam.2018.05.052]

31. Nazim Rehman, N.U.; Alghamdi, A. On Normalized Laplacian Spectra of the Weakly Zero-Divisor Graph of the Ring ℤn. Mathematics; 2023; 11, 4310. [DOI: https://dx.doi.org/10.3390/math11204310]

32. Ali, N.; Siddiqui HM, A.; Riaz, M.B.; Qureshi, M.I.; Akgül, A. A graph-theoretic approach to ring analysis: Dominant metric dimensions in zero-divisor graphs. Heliyon; 2024; 10, E30989. [DOI: https://dx.doi.org/10.1016/j.heliyon.2024.e30989]

33. Ali, N.; Siddiqui HM, A.; Qureshi, M.I. A Graph-Theoretical Approach to Ring Analysis: An Exploration of Dominant Metric Dimension in Compressed Zero Divisor Graphs and Its Interplay with Ring Structures. arXiv; 2024; arXiv: 2405.04934