Boxicity of Zero Divisor Graphs
Abstract
A d-dimensional box is the cartesian product Ri×·s× Rd where each Ri is a closed interval on the real line. The boxicity of a graph, denoted as box(G), is the minimum integer d≥ 0 such that G is the intersection graph of a collection of d-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) the set of zero divisors of a ring R. The zero divisor graph (R) for a ring R is defined as the graph with the vertex set V((R))=Z(R) and E((R))=\\ai,aj\:aiaj∈ Z(R) and aiaj=0 \. Let N=i=1apini be the prime factorization of N. In Discrete Applied Mathematics 365 (2025), pp. 260-269, it was shown that box((ZN))≤i=1a(ni+1)-i=1a( ni/2+1)-1. In this paper we exactly determine the boxicity of (ZN): We show that when N 2 4 and N is not divisible by p3 for any prime divisor p, we have box((ZN))=a-1. Otherwise box((ZN))=a. Suppose R is a non-zero commutative ring with identity that is also a reduced ring and let k be the size of the set of minimal prime ideals of R. In the same paper, it was showed that box((R))≤ 2k-2. We improve this result by showing k/2≤ box((R))≤ k with the same assumption on R. In this paper we also show that a-1≤TH((ZN))≤ a and k/2≤TH((R))≤ k, where TH is another dimensional parameter associated with graphs known as the threshold dimension.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.