Boxicity of Zero Divisor Graphs
L. Sunil Chandran, Suraj Kumar Sahoo

TL;DR
This paper precisely determines the boxicity of zero divisor graphs of rings, especially for rings like rac{Z}{Nrac{Z}{N}}, and improves bounds on the threshold dimension for such graphs, linking algebraic properties to graph dimensions.
Contribution
It provides exact values for the boxicity of zero divisor graphs of rac{Z}{N} and improves bounds on the threshold dimension for zero divisor graphs of reduced rings.
Findings
Exact boxicity of rac{Z}{N} determined under specific conditions.
Improved bounds on the threshold dimension for zero divisor graphs of reduced rings.
Established relationships between algebraic structure and graph dimensional parameters.
Abstract
A -dimensional box is the cartesian product where each is a closed interval on the real line. The boxicity of a graph, denoted as , is the minimum integer such that is the intersection graph of a collection of -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 the set of zero divisors of a ring . The zero divisor graph for a ring is defined as the graph with the vertex set and . Let be the prime…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications · Polynomial and algebraic computation
