Intervals of posets of a zero-divisor graph

Abstract This article is concerned with bounded partially ordered sets P such that for every p ∈ P ∖ {1} there exists q ∈ P ∖ {0} such that 0 is the only lower bound of { p , q }. The posets P such that P ≅ Q if and only if P and Q have isomorphic zero-divisor graphs are completely characterized. In the case of finite posets, this result is generalized by proving that posets with isomorphic zero-divisor graphs form an interval under the partial order given by P ≲ Q if and only if there exists a bijective poset-homomorphism P → Q . In particular, the singleton intervals correspond to the posets that are completely determined by their zero-divisor graphs. These results are obtained by exploring universal and couniversal orderings with respect to posets that have isomorphic zero-divisor graphs.