English

Boxicity of Zero Divisor Graphs

Discrete Mathematics 2025-05-20 v1

Abstract

A dd-dimensional box is the cartesian product Ri××RdR_i\times\cdots\times R_d where each RiR_i is a closed interval on the real line. The boxicity of a graph, denoted as box(G)box(G), is the minimum integer d0d\geq 0 such that GG is the intersection graph of a collection of dd-dimensional boxes. The study of graph classes associated with algebraic structures is a fascinating area where graph theory and algebra meet. A well-known class of graphs associated with rings is the class of zero divisor graphs introduced by Beck in 1988. Since then, this graph class has been studied extensively by several researchers. Denote by Z(R)Z(R) the set of zero divisors of a ring RR. The zero divisor graph Γ(R)\Gamma(R) for a ring RR is defined as the graph with the vertex set V(Γ(R))=Z(R)V(\Gamma(R))=Z(R) and E(Γ(R))={{ai,aj}:aiajZ(R) and aiaj=0}E(\Gamma(R))=\{\{a_i,a_j\}:a_ia_j\in Z(R)\text{ and }a_ia_j=0 \}. Let N=Πi=1apiniN=\Pi_{i=1}^ap_i^{n_i} be the prime factorization of NN. In Discrete Applied Mathematics 365 (2025), pp. 260-269, it was shown that box(Γ(ZN))Πi=1a(ni+1)Πi=1a(ni/2+1)1box(\Gamma(\mathbb{Z}_N))\leq\Pi_{i=1}^a(n_i+1)-\Pi_{i=1}^a(\lfloor n_i/2\rfloor+1)-1. In this paper we exactly determine the boxicity of Γ(ZN)\Gamma(\mathbb{Z}_N): We show that when N2(mod4)N\equiv 2\pmod 4 and NN is not divisible by p3p^3 for any prime divisor pp, we have box(Γ(ZN))=a1box(\Gamma(\mathbb{Z}_N))=a-1. Otherwise box(Γ(ZN))=abox(\Gamma(\mathbb{Z}_N))=a. Suppose RR is a non-zero commutative ring with identity that is also a reduced ring and let kk be the size of the set of minimal prime ideals of RR. In the same paper, it was showed that box(Γ(R))2k2box(\Gamma(R))\leq 2^k-2. We improve this result by showing k/2box(Γ(R))k\lfloor k/2\rfloor\leq box(\Gamma(R))\leq k with the same assumption on RR. In this paper we also show that a1dimTH(Γ(ZN))aa-1\leq\dim_{TH}(\Gamma(\mathbb{Z}_N))\leq a and k/2dimTH(Γ(R))k\lfloor k/2\rfloor\leq\dim_{TH}(\Gamma(R))\leq k, where dimTH\dim_{TH} is another dimensional parameter associated with graphs known as the threshold dimension.

Keywords

Cite

@article{arxiv.2505.12376,
  title  = {Boxicity of Zero Divisor Graphs},
  author = {L. Sunil Chandran and Suraj Kumar Sahoo},
  journal= {arXiv preprint arXiv:2505.12376},
  year   = {2025}
}
R2 v1 2026-07-01T02:19:37.807Z