The number of linear, directed, rooted and connected graphs. (English) Zbl 0065.16702
Keywords:
topologyOnline Encyclopedia of Integer Sequences:
Number of symmetric relations on n nodes.Number of disconnected graphs with n nodes.
Number of connected graphs with n nodes.
Triangle read by rows: T(n,k) = number of nonisomorphic unlabeled planar graphs with n >= 1 nodes and 0 <= k <= 3n-6 edges.
Triangle read by rows: T(n, k) is the number of unlabeled connected planar simple graphs with n >= 1 nodes and 0<=k<=3*n-6 edges.
Number of loopless multigraphs on infinite set of nodes with n edges.
References:
| [1] | C. M. Blair and H. R. Henze, The number of structural isomers of the more important types of aliphatic compounds, Journal of the American Chemical Society vol. 56 (1934) p. 157. |
| [2] | Rudolf Carnap, Logical Foundations of Probability, The University of Chicago Press, Chicago, Ill., 1950. · Zbl 0040.07001 |
| [3] | A. Cayley, Collected mathematical papers, Cambridge, 1889-1898, vol. 3, pp. 242-246 and vol. 11, pp. 365-367. |
| [4] | Robert L. Davis, The number of structures of finite relations, Proc. Amer. Math. Soc. 4 (1953), 486 – 495. · Zbl 0051.24702 |
| [5] | R. M. Foster, The number of series-parallel networks, Proceedings of the International Congress of Mathematicians, 1950, vol. 1, 1952, p. 646. |
| [6] | F. Harary and R. Z. Norman, Graph theory as a mathematical model in social science, Research Center for Group Dynamics, Monograph No. 2, Ann Arbor, 1953. |
| [7] | Frank Harary and Robert Z. Norman, The dissimilarity characteristic of Husimi trees, Ann. of Math. (2) 58 (1953), 134 – 141. · Zbl 0051.40502 · doi:10.2307/1969824 |
| [8] | Frank Harary and Robert Z. Norman, The dissimilarity characteristic of linear graphs, Proc. Amer. Math. Soc. 5 (1954), 131 – 135. · Zbl 0055.17201 |
| [9] | Frank Harary and George E. Uhlenbeck, On the number of Husimi trees. I, Proc. Nat. Acad. Sci. U. S. A. 39 (1953), 315 – 322. · Zbl 0053.13104 |
| [10] | C. A. Hurst, The enumeration of graphs in the Feynman-Dyson technique, Proc. Roy. Soc. London. Ser. A. 214 (1952), 44 – 61. · Zbl 0049.27502 · doi:10.1098/rspa.1952.0149 |
| [11] | D. König, Theorie der endlichen und unendlichen graphen, Leipzig, 1936, reprinted, New York, 1950. · JFM 62.0654.05 |
| [12] | A. C. Lunn and J. K. Senior, Isomerism and configuration, J. Phys. Chem. vol. 33 (1929) pp. 1027-1079. |
| [13] | R. Z. Norman, On the number of linear graphs with given blocks, Doctoral dissertation, University of Michigan, 1954. |
| [14] | Richard Otter, The number of trees, Ann. of Math. (2) 49 (1948), 583 – 599. · Zbl 0032.12601 · doi:10.2307/1969046 |
| [15] | G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen, Acta Math. vol. 68 (1937) pp. 145-254. · JFM 63.0547.04 |
| [16] | R. J. Riddell, Contributions to the theory of condensation, Doctoral dissertation, Department of Physics, University of Michigan, 1951. |
| [17] | Robert J. Riddell Jr., The number of Feynman diagrams, Physical Rev. (2) 91 (1953), 1243 – 1248. · Zbl 0053.17103 |
| [18] | R. J. Riddell Jr. and G. E. Uhlenbeck, On the theory of the virial development of the equation of state of mono-atomic gases, J. Chem. Phys. 21 (1953), 2056 – 2064. · doi:10.1063/1.1698742 |
| [19] | John Riordan and C. E. Shannon, The number of two-terminal series-parallel networks, J. Math. Phys. Mass. Inst. Tech. 21 (1942), 83 – 93. · doi:10.1002/sapm194221183 |
| [20] | H. Seifert and W. Threlfall, Lehrbuch der Topologie, Leipzig, 1934; reprinted New York, 1947. · JFM 60.0496.05 |
| [21] | G. E. Uhlenbeck, Some basic problems of statistical mechanics, Gibbs Lecture, American Mathematical Society, December 1950. |
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.
