Composition and product of cover-incomparability graphs

Abstract

Cover-Incomparability graphs (C-I graphs) form an interesting class of graphs arising from posets. A few classes of graphs are known to be C-I graphs so far. Composition operation and various graph products are usually used to produce more non-trivial graphs in a particular graph class, using the prime graphs in the class. In this paper, we attempt to study the effect of the composition, lexicographic and strong products of C-I graphs. We found that the lexicographic product of two C-I graphs, say G and H is a C-I graph if and only if either G is any C-I graph, and H is a complete graph or vice versa. A similar result holds for the strong product also. It can be observed that the composition operation is more general than lexicographic product and we obtain new classes of C-I graphs from this operation.