Skip to main content
Log in

Coding and enumeration of trees that can be laid upon a hexagon lattice

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

Abstract

A tree that can be superimposed upon a hexagon lattice is called a hexagon lattice tree. A method for mechanically coding, enumerating and drawing these objects is described, and has been tested for trees with up to ten vertices. For storage and information transmission, the code uses an expanded version of theN-tuple code in which edge vector elements having one of four possible values are inserted. For establishing uniqueness, it is used in combination with a hexagon lattice reference grid whose vertices are numbered sequentially in the tightest possible outward spiral. Published rules for the derivation ofN-tuple codes by hand are commented on, and a small error pointed out.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. E.C. Kirby, J. Math. Chem. 4 (1990)31.

    Google Scholar 

  2. E.C. Kirby,Proc. MATH/CHEM/COMP Conf., Dubrovnik (1990), J. Math. Chem. 8 (1991)77–87.

    Google Scholar 

  3. E.C. Kirby, J. Chem. Soc. Faraday Trans. 86 (1990)447.

    Google Scholar 

  4. I. Gutman, R.B. Mallion and J.W. Essam, Mol. Phys. 50 (1983)859.

    Google Scholar 

  5. B. O'Leary and R.B. Mallion, in:Graph Theory and Topology in Chemistry, ed. R.B. King and D.H. Rouvray, Studies in Physical and Theoretical Chemistry 51 (Elsevier, Amsterdam, 1987), pp. 544–551.

    Google Scholar 

  6. I. Gutman and E.C. Kirby, MATCH 26 (1991)111.

    Google Scholar 

  7. J.R. Brisson,Lipids in Human Nutrition (MTP Press, Lancaster, UK, 1982).

    Google Scholar 

  8. C.E. Soteros and S.G. Whittington, J. Math. Chem. 5 (1990)307.

    Google Scholar 

  9. J.V. Knop, W.R. Müller, K. Szymanski and N. Trinajstić,Computer Generation of Certain Classes of Molecules (SKTH/Kemija u industriji, Zagreb, 1985).

    Google Scholar 

  10. J.V. Knop, W.R. Müller, K. Szymanski, S. Nikolić, and N. Trinajstić, in:Computational Graph Theory, ed. D.H. Rouvray (Nova Science, New York, 1990).

    Google Scholar 

  11. M. Randić, J. Chem. Inf. Comput. Sci. 26 (1986)136–148.

    Google Scholar 

  12. M. Randić, Croat. Chem. Acta 59 (1986)327–342.

    Google Scholar 

  13. M. Randić, S. Nikolić, and N. Trinajstić, J. Mol. Struct. (THEOCHEM) 165 (1988)213–228.

    Google Scholar 

  14. N. Trinajstić, private communication (19th April 1989).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kirby, E.C. Coding and enumeration of trees that can be laid upon a hexagon lattice. J Math Chem 11, 187–197 (1992). https://doi.org/10.1007/BF01164203

Download citation

  • Issue Date:

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

Keywords

Navigation