Let L be a lattice with the least element 0. An element x ∈ L is a zero divisor if x∧ y = 0 for some y ∈ L∗ = L \ {0}. The set of all zero divisors is denoted by Z(L). We associate a simple graph Γ(L) to L with vertex set Z(L)∗ = Z(L) \ {0}, the set of non-zero zero divisors of L and distinct x, y ∈ Z(L)∗ are adjacent if and only if x ∧ y = 0. In this paper, we obtain certain properties and dia...

In [1], Afkhami and Khashyarmanesh introduced the cozero-divisor graph of a ring, Γ′(R), which examines relationships between principal ideals. We continue investigating the algebraic implications of the graph by developing the reduced cozero-divisor graph, which is a simpler analog. Acknowledgements: This research was undertaken at the Wabash College Mathematics REU in Crawfordsville, Indiana....

There is a natural graph associated to the zero-divisors of a commutative semiring with non-zero identity. In this article we essentially study zero-divisor graphs with respect to primal and non-primal ideals of a commutative semiring R and investigate the interplay between the semiring-theoretic properties of R and the graph-theoretic properties of ΓI(R) for some ideal I of R. We also show tha...

In previous literature Coykendall & Maney, as well as Axtell & Stickles, have discussed the concept of irreducible divisor graphs of elements in domains and ring with zero-divisors respectively, with two different definitions. In this paper we seek to look at the irreducible divisor graphs of ring elements under a hybrid definition of the two previous ones—in hopes that this graph will reveal s...

In this paper, we deal with zero-divisor graphs of posets. We prove that the diameter of such a graph is either 1, 2 or 3 while its girth is either 3, 4 or ∞. We also characterize zero-divisor graphs of posets in terms of their diameter and girth. © 2012 Elsevier B.V. All rights reserved.