×

Enumeration of self-complementary structures. (English) Zbl 0331.05005


MSC:

05A15 Exact enumeration problems, generating functions
11F03 Modular and automorphic functions
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] De Bruijn, N. G.: Pólya’s theory of counting. Applied combinatorial mathematics (1964) · Zbl 0144.00601
[2] De Bruijn, N. G.: Generalisation of Pólya’s fundamental theorem in enumerative combinatorial analysis. Indag. math. 21, 59-69 (1959) · Zbl 0085.00901
[3] Harary, F.: The number of linear, directed, rooted and connected graphs. Trans. amer. Math. soc. 78, 445-463 (1955) · Zbl 0065.16702
[4] Oberschelp, W.: Kombinatorische anzahlbestimmungen in relationen. Math. ann. 174, 53-78 (1967) · Zbl 0155.35002
[5] Palmer, E. M.: Asymptotic formulas for the number of self-complementary graphs and digraphs. Mathematika 17, 85-90 (1970) · Zbl 0196.27502
[6] Palmer, E. M.: On the number of n-plexes. Discrete math. 6, 377-390 (1973) · Zbl 0269.05110
[7] Read, R. C.: On the number of self-complementary graphs and digraphs. J. London math. Soc. 38, 99-104 (1963) · Zbl 0116.15001
[8] Wille, D.: Note on the enumeration of self-complementary m-placed relations. Discrete math. 10, 189-192 (1974) · Zbl 0289.05120
[9] Wille, D.: Asymptotische formeln für strukturzahlen. Dissertation (1971)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.