Incomparability graphs of the lattices \(L_{n}\) and \(L_n^{1^2}\)

DOI10.1016/j.endm.2017.11.022zbMath1383.05248OpenAlexW2774490970MaRDI QIDQ2413370

Amit Dabhole, Meenakshi P. Wasadikar

Publication date: 10 April 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.11.022

zbMATH Keywords

atomdominating setorder of a graphincomparable pairsneighbourhood of an element

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• The cozero-divisor graph of a commutative ring
• Cover-incomparability graphs of posets
• Coloring of commutative rings
• Dominating sets in perfect graphs
• Path length in the covering graph of a lattice
• Incomparability Graphs of Lattices II
• Coloring of lattices

This page was built for publication: Incomparability graphs of the lattices \(L_{n}\) and \(L_n^{1^2}\)