Diameter and Girth of Zero Divisor Graph of Multiplicative Lattices

Abstract

In this paper, we study the zero divisor graph m(L) of a multiplicative lattice L. We prove under certain conditions that for a reduced multiplicative lattice L having more than two minimal prime elements, m(L) contains a cycle and gr(m(L)) = 3. This essentially proves that for a reduced ring R with more than two minimal primes, gr(AG(R))) = 3 which settles the conjecture of Behboodi and Rakeei [9]. Further, we have characterized the diameter of m(L).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…