Triangles in self-complementary graphs
β Scribed by C.R.J Clapham
- Publisher
- Elsevier Science
- Year
- 1973
- Tongue
- English
- Weight
- 134 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract The class of selfβcomplementary symmetric graphs is characterized using the classification of finite simple group.
Graphs self-complementary in K,, -e exist for those values of n where self-complementary graphs do not exist. For these graphs, the structure of the complementing permutation is analysed and their diameter is determined. The definition is related to the notions of "self-complement index" and "self-
A regular self-complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.
In 1992, H. Zhang (J. Graph Theory 16, 1-5), using the classification of finite simple groups, gave an algebraic characterisation of self-complementary symmetric graphs. Yet, from this characterisation it does not follow whether such graphs, other than the well-known Paley graphs, exist. In this pap