Zero-divisor graphs of lower dismantlable lattices-II
classification
🧮 math.CO
keywords
graphslatticeszero-divisordismantlablelowerisomorphiccontinuedeals
read the original abstract
In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [20]. The present paper mainly deals with an Isomorphism Problem for the zero-divisor graphs of lattices. In fact, we prove that the zero-divisor graphs of lower dismantlable lattices with the greatest element 1 as join-reducible are isomorphic if and only if the lattices are isomorphic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.