The relation graph of a finite lattice L is defined to be a simple graph with the elements of L as vertices and two distinct vertices are adjacent if and only if they are comparable in L. We investigate the properties of relation graphs and characterize those lattices whose relation graphs are complete. The association between the relation graphs of isomorphic lattices is studied.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.