Zero-divisor graphs of lower dismantlable lattices I

DOI10.1515/MS-2016-0266MaRDI QIDQ5266449zbMATH OpenOpenAlexFDO

Authors Avinash Patil, B. N. Waphare, Vinayak Joshi, H. Y. Pourali

Publication date 6 June 2017

Published in Mathematica Slovaca (Search for Journal in Brave)

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

zbMATH Keywords

incomparability graphjoin-reduciblelower dismantlable latticenon-ancestor graphzero-divisor graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: In this paper, we study the zero-divisor graphs of a subclass of dismantlable lattices. These graphs are characterized in terms of the non-ancestor graphs of rooted trees.

Recommendations

• Zero-divisor graphs of lower dismantlable lattices. II
• The zero-divisor graph of a lattice
• A note on the zero divisor graph of a lattice
• On the zero divisor graphs of \(pm\)-lattices
• Zero-divisor graphs of matrices over lattices
• Distributive lattices with strong endomorphism kernel property as direct sums
• Zero-divisor graphs and lattices of finite commutative rings
• On zero divisor graphs
• Zero divisor graphs of lattices and primal ideals
• Generalizations of the zero-divisor graph

Cited in

(5)

• On the zero-divisor graph of Rickart *-rings
• Zero-divisor graphs of lower dismantlable lattices. II
• Perfect zero-divisor graphs
• Distributive lattices with strong endomorphism kernel property as direct sums
• Chromatic classification of dismantlable lattices

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

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