×

On the number of \(n\)-plexes. (English) Zbl 0269.05110


MSC:

05C30 Enumeration in graph theory
57Q05 General topology of complexes
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Harary, F., The number of linear, directed, rooted and connected graphs, Trans. Am. Math. Soc., 78, 445-463 (1955) · Zbl 0065.16702
[2] Harary, F., Applications of Pólyas theorem to permutation groups, (Harary, F., A seminar on graph theory (1967), Holt, Rinehart and Winston: Holt, Rinehart and Winston New York)
[3] Harary, F.; Palmer, E. M., Graphical enumeration (1973), Academic Press: Academic Press New York · Zbl 0266.05108
[4] Oberschelp, W., Kombinatorische Anzahlbestimmungen in Relationen, Math. Ann., 174, 53-58 (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] Pólya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math., 68, 145-254 (1937) · JFM 63.0547.04
[7] Read, R. C., On the number of self-complemantary graphs and digraphs, J. London Math. Soc., 38, 99-104 (1963) · Zbl 0116.15001
[8] Riordan, J., An introduction to combinatorial analysis (1958), Wiley: Wiley New York · Zbl 0078.00805
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.