Paths in r-partite self-complementary graphs

AbstractThis paper aims at finding best possible paths in r-partite self-complementary (r-p.s c.) graphs G(r). It is shown that, every connected bi-p.s.c. graphs G(2) of order p. with a bi-partite complementing permutation (bi-p.c.p) σ having mixed cycles, has a (p-3)-path and this result is best possible. Further, if the graph induced on each cycle of bi-p.c.p. of G(2) is connected then G(2) has a hamiltonian path. Lastly the fact that every r-p.s.c graph with an r-partite of σ has non-empty intersection with at least four partitions of G(r), has a hamiltonian path, is established. The graph obtained from G(r) by adding a vertex u constituting (r + 1)-st partition of G(r), which is the fixed point of σ∗ = (u)σ also has a hamiltonian path The last two results generalize the result that every self-complementary graph has a hamiltonian path