Dissimilarity characteristic theorems for graphs
HTML articles powered by AMS MathViewer
- by Frank Harary and Robert Z. Norman PDF
- Proc. Amer. Math. Soc. 11 (1960), 332-334 Request permission
References
-
G. W. Ford, R. Z. Norman and G. E. Uhlenbeck, Combinatorial problems in the theory of graphs, II, Proc. Nat. Acad. Sci. U.S.A. vol. 42 (1956) pp. 203-208.
F. Harary, An elementary theorem on graphs, Amer. Math. Monthly vol. 66 (1959) pp. 405-407.
F. Harary and R. Z. Norman, The dissimilarity characteristic of Husimi trees, Ann. of Math. vol. 58 (1953) pp. 134-141.
—, The dissimilarity characteristic of linear graphs, Proc. Amer. Math. Soc. vol. 5 (1954) pp. 131-135.
F. Harary and G. E. Uhlenbeck, On the number of Husimi trees, I, Proc. Nat. Acad. Sci. U.S.A. vol. 39 (1953) pp. 315-322.
D. König, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936; reprinted, New York, 1950.
R. Otter, The number of trees, Ann. of Math. vol. 49 (1948) pp. 583-599.
Additional Information
- © Copyright 1960 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 11 (1960), 332-334
- MSC: Primary 05.00
- DOI: https://doi.org/10.1090/S0002-9939-1960-0111699-6
- MathSciNet review: 0111699