Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Zero-divisor graphs of lower dismantlable lattices II

In: Mathematica Slovaca, vol. 68, no. 1
Avinash Patil - B. N. Waphare - Vinayak Joshi
Detaily:
Rok, strany: 2018, 225 - 238
Kľúčové slová:
dismantlable lattice, adjunct element, zero-divisor graph, rooted tree
O článku:
In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [{Patil, A.—Waphare, B. N.—Joshi, V.—Pourali, H. Y.: \textit{Zero-divisor graphs of lower dismantlable lattices I}, Math. Slovaca \textbf{67} (2017), 285–296]. 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.
Ako citovať:
ISO 690:
Patil, A., Waphare, B., Joshi, V. 2018. Zero-divisor graphs of lower dismantlable lattices II. In Mathematica Slovaca, vol. 68, no.1, pp. 225-238. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0095

APA:
Patil, A., Waphare, B., Joshi, V. (2018). Zero-divisor graphs of lower dismantlable lattices II. Mathematica Slovaca, 68(1), 225-238. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0095
O vydaní:
Publikované: 23. 2. 2018