Cycles in self-complementary graphs

Autor: S.B Rao
Jazyk: angličtina
Předmět:
Zdroj: Journal of Combinatorial Theory, Series B. (1):1-9
ISSN: 0095-8956
DOI: 10.1016/0095-8956(77)90044-2
Popis: Let G be a self-complementary graph of order p ≥ 8. It is shown that for every integer l, 3 ≤ l ≤ p − 2, G has an l-cycle. Further, if G is hamiltonian, then G is pancyclic.
Databáze: OpenAIRE