Paths in r-partite self-complementary graphs

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters

“…Having a factor with a diameter d of an r-partite graph G, we construct factors with the same diameter by extending a partite set of G into sets of all admissible cardinalities. The method is a special case of that used by Gangopadhyay and Rao Hebbare [7], although they studied just factors with given diameters not requiring their isomorphism. In the following lemmas we describe two different cases.…”

From Symmetry to Complexity: Self-complementary Graphs Unraveled

“…The subject was born under fortunate circumstances, and Rao [3] and Bosak [4] have traced its evolution over the last four decades. Additionally, it has been the subject of four Ph.D. theses, at least partially [5,6,7,8], and four more that address related subjects [9,10,11,12], in addition to the hundreds of papers that have been published so far. In the discipline of graph theory, self-complementary graphs are a fascinating and significant subject.…”