Skip to main content
Log in

Embedding frequencies of trees

  • Papers
  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

Abstract

A graph γ is said to be embedded in a graph Γ if γ is isomorphic to a subgraph of Γ. The embedding frequency for γ in Γ,N( Γ, γ), is the number of different subgraphs of Γ to which γ is isomorphic. We use a computer program to calculate the embedding frequencies of subtrees within trees. We computeN(Γ, γ) for trees through 10 vertices and present the results in tabular form. When trees are partially ordered by valence class, their subtrees lie in corresponding order; we give a formal proof of this subtree embedding property. The structure of the embedding relation is exhibited in a topological picture of the zeta function showing the non-zero values ofN(Γ, γ).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chemical Applications of Topology and Graph Theory, ed. R.B. King (Elsevier, 1983).

  2. K. Balasubramanian, Chem. Rev. 85 (l985)599.

    Google Scholar 

  3. J.W. Essam, J.W. Kennedy, M. Gordon and P. Whittle, J. Chem. Soc. Faraday II 73 (1977) 1289.

    Google Scholar 

  4. D.J. Klein, Int. J. Quant. Chem. S20 (1986)153.

    Google Scholar 

  5. N. Trinajstić, D.J. Klein and M. Randić, Int. J. Quant. Chem. S20 (1986)699.

    Google Scholar 

  6. D.H. Rouvray, Chem. Soc. Rev. 3 (1972)355; D.H. Rouvray, Endeavour 34(1975)28.

    Google Scholar 

  7. L.B. Kier and L.H. Hall,Molecular Connectivity in Chemistry and Drug Research (Academic Press, 1976).

  8. A. Cayley, Amer. J. Math. 4 (1881)266; A. Cayley, Rep. Brit. Assoc. Adv. Sci. 45(1875)257.

    Google Scholar 

  9. G. Pólya, Comptes Rendus Hebdomadaires des Seances de l'Academie des Sciences (Paris) 201 (1935)1167.

    Google Scholar 

  10. H.R. Henze and C.M. Blair, J. Amer. Chem. Soc. 56 (1934)157.

    Google Scholar 

  11. J.V. Knop, W.R. Müller, K. Szymanski and N. Trinajstić,Computer Generation of Certain Classes of Molecules, Association of Chemists and Technologists of Croatia, Sveucilisna naklada Libir, 41000 Zagrab, Yugoslavia (1985).

  12. Graphical Enumeration, ed. F. Harary and E.M. Palmer (Academic Press, 1973).

  13. F. Ruskey, SIAM J. Comput. 10 (1981)151.

    Google Scholar 

  14. N. Alon, Israel J. Math. 53 (1986)97.

    Google Scholar 

  15. M. Gordon and J.W. Kennedy, J. Chem. Soc. Faraday II 69 (l973)484.

    Google Scholar 

  16. D.J. Klein, G.E. Hite and T.G. Schmalz, J. Compt. Chem. 7 (1986)443.

    Google Scholar 

  17. Graph Theory and Computing, ed. R.C. Read (Academic Press, 1972).

  18. J.V. Knop, W.R. Müller, Z. Jericević and N. Trinajstić, J. Chem. Inf. Comput. Sci. 21 (1981)91.

    Google Scholar 

  19. I. Guturan and M. Randić, Chem. Phys. Lett 47 (1977)15.

    Google Scholar 

  20. E. Ruch, Theor. Chim. Acta 38 (1975)167.

    Google Scholar 

  21. W. Lederuran,Introduction to the Theory of Finite Groups (Oliver and Boyd, 1957) p. 71.12.

  22. R.F. Muirhead, Proc. Edinburgh Math. Soc. 19 (1901)36; 21(1903)144; 24(1906)45.

    Google Scholar 

  23. R.C. Read, J. Chem. Inf. Comput. Sci. 23 (1983)135.

    Google Scholar 

  24. J.W. Kennedy and W. Gordon, Ann. New York Acad. Sci. 319 (1979)331.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Poshusta, R.D., McHughes, M.C. Embedding frequencies of trees. J Math Chem 3, 193–215 (1989). https://doi.org/10.1007/BF01166048

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Navigation