Incomparability graphs of dismantable lattices
DOI10.1142/S1793557120500345zbMATH Open1435.06002OpenAlexW2892651575WikidataQ129245316 ScholiaQ129245316MaRDI QIDQ5221002FDOQ5221002
S. K. Nimbhorkar, Vidya S. Deshmukh
Publication date: 27 March 2020
Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793557120500345
eigenvaluecharacteristic polynomialrealizabilitycovering matrixdismantlable latticeincomparability graphcovering energy
Structural characterization of families of graphs (05C75) Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05)
Cites Work
- Title not available (Why is that?)
- Coloring of commutative rings
- The zero-divisor graph of a commutative ring
- Beck's coloring of a commutative ring
- Title not available (Why is that?)
- Title not available (Why is that?)
- A structure theorem for dismantlable lattices and enumeration
- Crowns, Fences, and Dismantlable Lattices
- Lattices with Doubly Irreducible Elements
- Incomparability Graphs of Lattices II
- Coloring of lattices
- Title not available (Why is that?)
- On generalized zero divisor graph of a poset
This page was built for publication: Incomparability graphs of dismantable lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221002)
