## Abstract The class of self‐complementary symmetric graphs is characterized using the classification of finite simple group.
Transitive tournaments and self-complementary graphs
✍ Scribed by András Gyárfás
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 55 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0364-9024
- DOI
- 10.1002/jgt.1027
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A simple proof is given for a result of Sali and Simonyi on self‐complementary graphs. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 111–112, 2001
📜 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
We characterize the class of self-complementary vertex-transitive digraphs on a prime number p of vertices. Using this, we enumerate (i) self-complementary strongly vertex-transitive digraphs on p vertices, (ii) self-complementary vertex-transitive digraphs on p vertices, (iii) selfcomplementary ver
## 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].
## Abstract In this paper, we first consider graphs allowing symmetry groups which act transitively on edges but not on darts (directed edges). We see that there are two ways in which this can happen and we introduce the terms __bi‐transitive__ and __semi‐transitive__ to describe them. We examine t