Zero-divisor graphs of lower dismantlable lattices. II

DOI10.1515/MS-2017-0095MaRDI QIDQ4605347zbMATH OpenOpenAlexFDO

Authors Avinash Patil, B. N. Waphare, Vinayak Joshi

Publication date 22 February 2018

Published in Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.09663

zbMATH Keywords

adjunct elementdismantlable latticerooted treezero-divisor graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorics of partially ordered sets (06A07)

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.

Recommendations

• Zero-divisor graphs of lower dismantlable lattices I
• The zero-divisor graph of a lattice
• Zero divisor graph of a lattice with respect to an ideal
• Some properties of graphs derived from lattices
• Zero divisor graphs of lattices and primal ideals

Cited in

(7)

• On the zero-divisor graph of Rickart *-rings
• On the zero divisor graphs of \(pm\)-lattices
• Characterizations of connected orthogonality graphs of projections of Rickart ∗-rings
• Perfect zero-divisor graphs
• Distributive lattices with strong endomorphism kernel property as direct sums
• Zero-divisor graphs of lower dismantlable lattices I
• Intervals of posets of a zero-divisor graph

This page was built for publication: Zero-divisor graphs of lower dismantlable lattices. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4605347)