Zero divisor graph of boolean lattice
Abstract
The concept of zero divisor graph has been previously studied in algebraic structures like commutative rings, semi groups, semi lattices and ordered sets. In this paper, we investigate the properties of zero divisor graph of boolean lattices. Let L be a lattice and Γ(L) be the zero divisor graph of L. We find a relationship between the clique number and chromatic number of Γ(L) and some properties of zero divisor graph of boolean lattices. We also study the relationship between aut(L) and aut(Γ(L)) and establish the isomorphism between them.
Copyright © 2022 S. Aswathy, Gigi Thomas, Jill K. Mathew. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
S. Aswathy, G. Thomas, J. K. Mathew, Zero divisor graph of boolean lattice, J. Math. Comput. Sci. 12 (2022), 71. https://doi.org/10.28919/jmcs/6969
BibTeX
@article{Aswathy2022,
author = {Aswathy, S. and Thomas, Gigi and Mathew, Jill K.},
title = {Zero divisor graph of boolean lattice},
journal = {J. Math. Comput. Sci.},
volume = {12},
year = {2022},
pages = {71},
doi = {10.28919/jmcs/6969}
}