The Number of Graphs with a given Automorphism Group
Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 1068-1076
Voir la notice de l'article provenant de la source Cambridge University Press
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.
Sheehan, J. The Number of Graphs with a given Automorphism Group. Canadian journal of mathematics, Tome 20 (1968) no. 1, pp. 1068-1076. doi: 10.4153/CJM-1968-103-x
@article{10_4153_CJM_1968_103_x,
author = {Sheehan, J.},
title = {The {Number} of {Graphs} with a given {Automorphism} {Group}},
journal = {Canadian journal of mathematics},
pages = {1068--1076},
year = {1968},
volume = {20},
number = {1},
doi = {10.4153/CJM-1968-103-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1968-103-x/}
}
[1] 1. Burnside, W., Theory of groups of finite order, 2nd ed. (Cambridge Univ. Press, Cambridge, 1911). Google Scholar
[2] 2. Foulkes, H. O., On Redfield's group reduction functions, Can. Math, J., 14 (1963), 272–284. Google Scholar
[3] 3. Hall, M., Jr., Theory of groups (Macmillan, New York, 1959). Google Scholar
[4] 4. Murnaghan, F. D., The theory of group representations (John Hopkins, Baltimore, 1938). Google Scholar
[5] 5. Sheehan, J., On Polya's theorem, Can. J. Math. 19 (1967), 792–799. Google Scholar
Cité par Sources :