Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

Dissimilarity characteristic theorems for graphs


Authors: Frank Harary and Robert Z. Norman
Journal: Proc. Amer. Math. Soc. 11 (1960), 332-334
MSC: Primary 05.00
MathSciNet review: 0111699
Full-text PDF Free Access

References | Similar Articles | Additional Information

References [Enhancements On Off] (What's this?)

  • [1] 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.
  • [2] F. Harary, An elementary theorem on graphs, Amer. Math. Monthly vol. 66 (1959) pp. 405-407.
  • [3] F. Harary and R. Z. Norman, The dissimilarity characteristic of Husimi trees, Ann. of Math. vol. 58 (1953) pp. 134-141.
  • [4] -, The dissimilarity characteristic of linear graphs, Proc. Amer. Math. Soc. vol. 5 (1954) pp. 131-135.
  • [5] 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.
  • [6] D. König, Theorie der endlichen und unendlichen Graphen, Leipzig, 1936; reprinted, New York, 1950.
  • [7] R. Otter, The number of trees, Ann. of Math. vol. 49 (1948) pp. 583-599.

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05.00

Retrieve articles in all journals with MSC: 05.00


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1960-0111699-6
PII: S 0002-9939(1960)0111699-6
Article copyright: © Copyright 1960 American Mathematical Society