The number of linear, directed, rooted, and connected graphs
Author:
Frank Harary
Journal:
Trans. Amer. Math. Soc. 78 (1955), 445463
MSC:
Primary 56.0X
DOI:
https://doi.org/10.1090/S00029947195500681982
MathSciNet review:
0068198
Fulltext PDF Free Access
References  Similar Articles  Additional Information

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.
 Rudolf Carnap, Logical Foundations of Probability, The University of Chicago Press, Chicago, Ill., 1950. MR 0040253 A. Cayley, Collected mathematical papers, Cambridge, 18891898, vol. 3, pp. 242246 and vol. 11, pp. 365367.
 Robert L. Davis, The number of structures of finite relations, Proc. Amer. Math. Soc. 4 (1953), 486–495. MR 55294, DOI https://doi.org/10.1090/S00029939195300552942 R. M. Foster, The number of seriesparallel networks, Proceedings of the International Congress of Mathematicians, 1950, vol. 1, 1952, p. 646. 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.
 Frank Harary and Robert Z. Norman, The dissimilarity characteristic of Husimi trees, Ann. of Math. (2) 58 (1953), 134–141. MR 55693, DOI https://doi.org/10.2307/1969824
 Frank Harary and Robert Z. Norman, The dissimilarity characteristic of linear graphs, Proc. Amer. Math. Soc. 5 (1954), 131–135. MR 59535, DOI https://doi.org/10.1090/S00029939195400595358
 Frank Harary and George E. Uhlenbeck, On the number of Husimi trees. I, Proc. Nat. Acad. Sci. U.S.A. 39 (1953), 315–322. MR 53893, DOI https://doi.org/10.1073/pnas.39.4.315
 C. A. Hurst, The enumeration of graphs in the FeynmanDyson technique, Proc. Roy. Soc. London Ser. A 214 (1952), 44–61. MR 52332, DOI https://doi.org/10.1098/rspa.1952.0149 D. König, Theorie der endlichen und unendlichen graphen, Leipzig, 1936, reprinted, New York, 1950. A. C. Lunn and J. K. Senior, Isomerism and configuration, J. Phys. Chem. vol. 33 (1929) pp. 10271079. R. Z. Norman, On the number of linear graphs with given blocks, Doctoral dissertation, University of Michigan, 1954.
 Richard Otter, The number of trees, Ann. of Math. (2) 49 (1948), 583–599. MR 25715, DOI https://doi.org/10.2307/1969046 G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen, und chemische Verbindungen, Acta Math. vol. 68 (1937) pp. 145254. R. J. Riddell, Contributions to the theory of condensation, Doctoral dissertation, Department of Physics, University of Michigan, 1951.
 Robert J. Riddell Jr., The number of Feynman diagrams, Phys. Rev. (2) 91 (1953), 1243–1248. MR 58499
 R. J. Riddell Jr. and G. E. Uhlenbeck, On the theory of the virial development of the equation of state of monoatomic gases, J. Chem. Phys. 21 (1953), 2056–2064. MR 59207, DOI https://doi.org/10.1063/1.1698742
 John Riordan and C. E. Shannon, The number of twoterminal seriesparallel networks, J. Math. Phys. Mass. Inst. Tech. 21 (1942), 83–93. MR 7511, DOI https://doi.org/10.1002/sapm194221183 H. Seifert and W. Threlfall, Lehrbuch der Topologie, Leipzig, 1934; reprinted New York, 1947. G. E. Uhlenbeck, Some basic problems of statistical mechanics, Gibbs Lecture, American Mathematical Society, December 1950.
Retrieve articles in Transactions of the American Mathematical Society with MSC: 56.0X
Retrieve articles in all journals with MSC: 56.0X
Additional Information
Article copyright:
© Copyright 1955
American Mathematical Society