Skip to main content

Recent results on trees

Part I: Invited Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

Abstract

Our object is to present six theorems on trees discovered since the appearance of the book [4]. These deal with (1) trees with hamiltonian square, (2) path numbers, (3) the tree graph of a graph, (4) the intersection graph of subtrees of a tree, (5) cospectral trees, and (6) the probability of an endpoint.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Buneman, P., A Characterization of Rigid Circuit Graphs, Discrete Math., to appear.

    Google Scholar 

  2. Collatz, L., and Sinogowitz, U., Spektren endlicher Graphen, Abh. Math. Sem. Univ. Hamburg 211 (1957) 64–77.

    MathSciNet  Google Scholar 

  3. Fleishner, H. J., The Square of Every Nonseparable Graph is Hamiltonian, J. Combinatorial Theory, to appear.

    Google Scholar 

  4. Harary, F., Graph Theory, Addison-Wesley, Reading, 1969.

    Google Scholar 

  5. Harary, F., and Holzmann, C., On the Tree Graph of a Matroid, SIAM J. Appl. Math. 22 (1972) 187–193.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Harary, F., and Schwenk, A. J., Trees with Hamiltonian Square, Mathematika 18 (1971) 138–140.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Harary, F., and Schwenk, A. J., Evolution of the Path Number of a Graph. Graph Theory and Computing (R.C. Read, ed.) Academic Press, New York, 1972, 39–45.

    Google Scholar 

  8. Pólya, G., Kombinatorisone Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen, Acta Math. 68 (1937) 145–254.

    CrossRef  Google Scholar 

  9. Rényi, A., Some Remarks on the Theory of Trees, Publ. Math. Inst. Hungar. Acad. Sci. 4 (1959) 73–85.

    MATH  Google Scholar 

  10. Robinson, R. W., and Schwenk, A. J., The Probability of an Endpoint in a Large Random Tree, Proc. Camb. Phil. Soc., submitted.

    Google Scholar 

  11. Schwenk, A. J., Almost All Trees are Cospectral, New Directions in the Theory of Graphs (F. Harary, ed.) Academic Press, New York, 1973, 275–307.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Harary, F. (1974). Recent results on trees. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066429

Download citation

  • DOI: https://doi.org/10.1007/BFb0066429

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06854-9

  • Online ISBN: 978-3-540-37809-9

  • eBook Packages: Springer Book Archive