Facebook Instagram Twitter RSS Feed PodBean Back to top on side

The zero divisor graphs of Boolean posets

In: Mathematica Slovaca, vol. 64, no. 2
Vinayak Joshi - Anagha Khiste
Detaily:
Rok, strany: 2014, 511 - 519
Kľúčové slová:
zero divisor graph, uniquely complemented poset, pseudocomplemented poset, Boolean poset
O článku:
In this paper, it is proved that if $B$ is a Boolean poset and $S$ is a bounded pseudocomplemented poset such that $S\setminus Z(S)=\{1\}$, then $Γ(B)\cong Γ(S)$ if and only if $B\cong S$. Further, we characterize the graphs which can be realized as zero divisor graphs of Boolean posets.
Ako citovať:
ISO 690:
Joshi, V., Khiste, A. 2014. The zero divisor graphs of Boolean posets. In Mathematica Slovaca, vol. 64, no.2, pp. 511-519. 0139-9918. DOI: https://doi.org/10.2478/s12175-014-0221-y

APA:
Joshi, V., Khiste, A. (2014). The zero divisor graphs of Boolean posets. Mathematica Slovaca, 64(2), 511-519. 0139-9918. DOI: https://doi.org/10.2478/s12175-014-0221-y
O vydaní: