Lattice of Convex Sets of a Connected Graph
Main Article Content
Abstract
It is known that the set of all convex sets of a finite connected graph together with empty set partially ordered by set inclusion relation forms a lattice. In this paper we studied some of the properties of these lattices for Trees and complete graphs.
Article Details
Issue
Section
Articles