Graphs self-complementary in \(K_ n-e\) (Q1813737)

A graph \(G\) with \(n\) vertices is called self-complementary (s.c.) in \(K_ n-e\) if \(K_ n-e\) is the edge-disjoint union of two subgraphs \(G_ 1\), \(G_ 2\) isomorphic to \(G\), and a corresponding permutation of \(V(G)\) induced by an isomorphism from \(G_ 1\) to \(G_ 2\) is called a complementing permutation. The structure of complementing permutations is analyzed and the diameter of graphs which are s.c. in \(K_ n-e\) is determined.