Characterization of self-complementary symmetric digraphs
β Scribed by Hong Zhang
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 266 KB
- Volume
- 161
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
The class of self-complementary symmetric digraphs is characterized and it is shown that the number of vertices of such a digraph is an odd prime power.
π SIMILAR VOLUMES
## Abstract The class of selfβcomplementary symmetric graphs is characterized using the classification of finite simple group.
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
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 prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side 2n equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube, without explicitly evaluating either of these numbers. This appea