Abstract:

In this paper, we find the independence number of the complement H=\overline{G\overline{G}} of the complementary prism G\overline{G} of a graph G in terms of G. We obtain sharp upper and lower bounds of the clique number of H in terms of G. In particular, the chromatic and clique numbers of H when G is a complete graph or a star are computed.