Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-27T07:51:51.665Z Has data issue: false hasContentIssue false
  • English
  • Français

The Number of Graphs with a given Automorphism Group

Published online by Cambridge University Press:  20 November 2018

J. Sheehan
J. Sheehan*
Affiliation:
King's College, Aberdeen, Scotland
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper, the graphs under consideration may have multiple edges but they do not have loops. We enumerate the number N[H: n, p] of topologically distinct graphs with n vertices and p edges whose automorphism group is the permutation group H. As in (5), this enumeration is considered in the context of the theory of permutation representations of finite groups. We begin with some definitions and notation.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 20 , 1968 , pp. 1068 - 1076
Copyright
Copyright © Canadian Mathematical Society 1968

References

1. Burnside, W., Theory of groups of finite order, 2nd ed. (Cambridge Univ. Press, Cambridge, 1911).Google Scholar
2. Foulkes, H. O., On Redfield's group reduction functions, Can. Math, J., 14 (1963), 272–284.Google Scholar
3. Hall, M., Jr., Theory of groups (Macmillan, New York, 1959).Google Scholar
4. Murnaghan, F. D., The theory of group representations (John Hopkins, Baltimore, 1938).Google Scholar
5. Sheehan, J., On Polya's theorem, Can. J. Math. 19 (1967), 792–799.Google Scholar