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
The enumeration of transitive self-complementary digraphs
โ Scribed by N. Hegde; R.C. Read; M.R. Sridharan
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 320 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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.
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
## Abstract Necklaces with beads of two colors which are left unchanged both by a reflection as well as by the interchange of the two colors are characterized in terms of their axes of symmetry. This characterization is then used to enumerate them. For __n__ = 2^__r__^m with __r__ โฅ 1 and __m__ odd