The graph of equivalence classes of zero divisors (Q470537)

Summary: We introduce a graph \(G_E(L)\) of equivalence classes of zero divisors of a meet semilattice \(L\) with 0. The set of vertices of \(G_E(L)\) are the equivalence classes of nonzero zero divisors of \(L\) and two vertices \([x]\) and \([y]\) are adjacent if and only if \([x]\wedge [y]=[0]\). It is proved that \(G_E(L)\) is connected and either it contains a cycle of length 3 or \(G_E(L)\cong K_2\). It is known that two Boolean lattices \(L_1\) and \(L_2\) have isomorphic zero divisor graphs if and only if \(L_1\cong L_2\). This result is extended to the class of SSC meet semilattices. Finally, we show that Beck's Conjecture is true for \(G_E(L)\).