## Abstract The class of selfβcomplementary symmetric graphs is characterized using the classification of finite simple group.
Self-complementary graphs
β Scribed by Richard A Gibbs
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 762 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
## Abstract It is shown that certain conditions assumed on a regular selfβcomplementary graph are not sufficient for the graph to be strongly regular, answering in the negative a question posed by Kotzig in [1].