The zero divisor graphs of Boolean posets
AbstractIn this paper, it is proved that if B is a Boolean poset and S is a bounded pseudocomplemented poset such that S\Z(S) = {1}, then Γ(B) ≌ Γ(S) if and only if B ≌ S. Further, we characterize the graphs which can be realized as zero divisor graphs of Boolean posets.
2018 ◽
Vol 11
(06)
◽
pp. 1850097
◽
2020 ◽
Vol 9
(12)
◽
pp. 10591-10612
2020 ◽
Vol 9
(8)
◽
pp. 5901-5908
Keyword(s):
2020 ◽
Vol 0
(0)
◽
2008 ◽
Vol 308
(22)
◽
pp. 5122-5135
◽
2012 ◽
Vol 137
(1-2)
◽
pp. 27-35
◽