On cyclically \(K\)-complementary graphs (Q1322215): Difference between revisions

As a generalization of the concept of self-complementary graph, the author introduces the concept of cyclically \(k\)-complementary graph. Let \(K_ n\) be complete graph of order \(n\), and \(\{H_ i:i = 1,2, \dots, k\}\) be an isomorphic factorization of \(K_ n\). A graph isomorphic to \(H_ i\) is called cyclically \(k\)-complementary, if there is a permutation \(\beta\) of \(V(K_ n)\) such that \(\beta\) is an isomorphism from \(H_ i\) to \(H_{i+1}\) for each \(i\). The paper investigates conditions for the existence of cyclically \(k\)-complementary graphs.