On Isomorphism theorem of the Comparability Graph of Lattices

Abstract

In recent years, researchers have actively contributed to the field of graphs associated with algebraic structures and ordered structures. It is a fundamental question to ask whether we infer algebraic or ordered structure from associated graphs and vice versa. In this paper, we gave characterizations about comparability graphs and associated lattices. In particular, we determined some properties of lattices that are preserved under the graph isomorphism. We have also provided a technique to construct non-isomorphic lattices with isomorphic comparability graphs. Also, we find two classes of lattices in which the graph isomorphism gives the lattice isomorphism.