On the graph of C-Lattices

Abstract

Let L be a C-lattice. In this paper, we associate to each C-lattice L, an undirected simple graph P(L) in which the vertex set is the collection of all non-trivial practice, for "even more basic," it can be omitted if we assume a very simple environment where ASCII or a default proper elements of L and two different members a and b of vertex set of P(L) are adjacent if and only compatible encoding is used. The symbols used (`∨`) are part of HTML entities and should render. 3. if a v b (a join b) is a prime element of L. Also, we obtain the interrelationship between some algebraic properties of C-lattice L and graph-theoretic properties of P(L).