Abstract:
Solutions of known problems in the enumeration of graphs are obtained. The number of graphs is expressed, by using a lemma proved by Burnside, in terms of the values of an auxiliary combinatorial function of the partitions of a number. These values, expressing the number of strongly connected graphs having a fixed automorphism of a given cyclic type, are determined by a system of linear recurrence relations.
Fulltext:
PDF file (1569 kB)
