Article contents
An easier enumeration of self-complementary graphs
Published online by Cambridge University Press: 20 January 2009
Extract
The number of self-complementary (s.c.) graphs and digraphs with a given number of vertices was found by R. C. Read in [1]. That paper used a special case of De Bruijn's generalisation of Polya's theorem that involved the cycle-index of Gn, the group of permutations of pairs of vertices induced by permutations of the vertices. We obtain Read's formulae by using only well-known elementary facts about s.c. graphs and their complementing permutations.
- Type
- Research Article
- Information
- Copyright
- Copyright © Edinburgh Mathematical Society 1984
References
REFERENCES
- 1
- Cited by