On the Lattice Con(G)

Abstract

A lattice is made by combining all convex sets iof ia ifinite iconnected igraph iwith an empty set ithat is ipartially iordered by set inclusion relation, ias iis iwidely iknown. The iempty iset ipartially sorted by set inclusion irelation iand the iset of iall ipath sets iof ia ifinite iconnected igraph iform a ilattice.

We looked at some of the features of these lattices for full bipartite graphs and cycles in this study.