Wheels, Cages and Cubes
G. Sudhakara · Hindustan Book Agency · 2002
Let G = 〈V, E〉 be a graph of order p ≥ 2 and P = {V1, V2, … V k } be a partition of V of order k. The k-complement G of G is obtained as follows: For all V i and V j in P, i ≠ j, remove the edges between V i and V j , and add the missing edges between them. G is said to be k-self-complementary if for some partition P of V of order k, G ≈ G; and it is said to be k-co-self-complementary if G k p ≈ G ¯ $$G_k^p \approx \overline G$$ . In this paper we characterize the k-self-complementary generalized wheels, cubes and cages.