×

The number of strongly connected directed graphs. (English. Russian original) Zbl 0217.31001

Math. Notes 8(1970), 877-882 (1971); translation from Mat. Zametki 8, 721-732 (1970).

MSC:

05C30 Enumeration in graph theory
05C20 Directed graphs (digraphs), tournaments

Citations:

Zbl 0182.577
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] N. G. de Bruijn, Polya’s Theory of Counting, in: Applied Combinatorial Mathematics, E. F. Beckenback (editor), John Wiley and Sons, New York (1964). · Zbl 0144.00601
[2] N. Gilbert, ”Enumeration of labelled graphs,” Canad. J. Math.,8, No. 3, 405–411 (1956). · Zbl 0071.39102
[3] F. Harary, ”The number of linear, directed, rooted and connected graphs,” Trans. Amer. Math. Soc.,78, No. 2, 445–463 (1955). · Zbl 0065.16702
[4] F. Harary, ”Problems in counting graphs,” Uspekhi Matem. Nauk,24, No. 5, 179–214 (1969).
[5] F. Harary, Combinatorial Problems in Graphical Enumeration, in: E. F. Beckenbach (editor), Applied Combinatorial Mathematics, John Wiley and Sons, New York (1964). · Zbl 0158.20801
[6] F. Harary, ”On the number of bicolored graphs,” Pacif. J. Math.,8, No. 4, 743–755 (1958). · Zbl 0084.19402
[7] W. Oberschelp, ”Kombinatorische Anzahlbestimmungen in Relationen,” Math. Ann., 174, No. 1, 53–78 (1967). · Zbl 0155.35002
[8] V. A. Liskovets, ”A recurrence method of counting graphs with labelled points,” Dokl. Akad. Nauk SSSR,184, No. 6, 1284–1287 (1969). · Zbl 0184.49204
[9] V. A. Liskovets, ”The enumeration of rooted source digraphs,” Izv. Akad. Nauk, Byelorussian SSR, Ser. Fiz.-Matem. Nauk, No. 5, 23–32 (1969).
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.