论文信息 - APPLICATIONS OF A TECHNIQUE FOR LABELLED ENUMERATION

APPLICATIONS OF A TECHNIQUE FOR LABELLED ENUMERATION

A technique involving summation over roots of unity was used by Liskovec in 1971 to count labelled regular tournaments. The same method is used here to count regular tournaments to 21 vertices, Eulerian digraphs to 16 vertices, Eulerian oriented graphs to 15 vertices, regular graphs to 21 vertices, regular bipartite graphs to 40 vertices, and Eulerian circuits in complete graphs with up to 17 vertices. The last calculation was performed jointly with R. W. Robinson. All the objects counted are vertex-labelled.

Brendan D. McKay

[1] R. C. Read,et al. The Enumeration of Locally Restricted Graphs (I) , 1959 .

[2] Germund Dahlquist,et al. Extrapolation of asymptotic expansions by a modified Aitken δ2-formula , 1979 .

[3] Nicholas C. Wormald. Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity , 1979 .

[4] Edward A. Bender,et al. The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[5] Ronald C. Read. Some Unusual Enumeration Problems , 1970 .

[6] Nicholas C. Wormald,et al. Number of labeled 4-regular graphs , 1980, J. Graph Theory.

[7] Ian P. Goulden,et al. THE HAMMOND SERIES OF A SYMMETRIC FUNCTION AND ITS APPLICATION TO P-RECURSIVENESS* , 1983 .

[8] Patrick Eugene O'Neil. Asymptotics and random matrices with row-sum and column sum-restrictions , 1969 .

[9] Béla Bollobás,et al. A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..