Abstract
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.

This publication has 0 references indexed in Scilit: