Hostname: page-component-8448b6f56d-cfpbc Total loading time: 0 Render date: 2024-04-23T23:17:01.662Z Has data issue: false hasContentIssue false
  • English
  • Français

The enumeration of tree-like polyhexes†

Published online by Cambridge University Press:  20 January 2009

Frank Harary  and
Ronald C. Read
Frank Harary
Affiliation:
University of Michigan, Ann Arbor, U.S.A.
Ronald C. Read
Affiliation:
University of the West Indies, Kingston, Jamaica
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A problem of considerable interest in combinatorial analysis is that of determining the number of ways in which a connected figure can be constructed in the plane by assembling n regular hexagons in such a way that two hexagons abut on each other, if at all, along the whole of a common edge. Examples of these constructions can be seen in the various figures in this paper.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 17 , Issue 1 , June 1970 , pp. 1 - 13
Copyright
Copyright © Edinburgh Mathematical Society 1970

References

REFERENCES

(1) Balaban, A. T. and Harary, F., Chemical graphs. V. Enumeration and proposed nomenclature of benzenoid cata-condensed polycyclic aromatic hydrocarbons, Tetrahedron 24 (1968), 2505–2516.Google Scholar
(2) Golomb, W. S., Polyominoes (Scribner’s, New York, 1965).Google Scholar
(3) Harary, F., The number of linear, directed, rooted and connected graphs, Trans. Amer. Math. Soc. 78 (1955), 445–463.CrossRefGoogle Scholar
(4) Harary, F., Graphical enumeration problems, Chapter 1 in Graph Theory and Theoretical Physics (Harary, F., ed.) (Academic Press, London, 1967, pp. 1–41).Google Scholar
(5) Harary, F. and Norman, R. Z., Dissimilarity characteristic theorems for graphs, Proc. Amer. Math. Soc. 11 (1960), 332–334.Google Scholar
(6) Harary, F. and Prins, G., The number of homeomorphically irreducible trees and other species, Acta Math. 101 (1959), 141–162.CrossRefGoogle Scholar
(7) Klarner, D., Some results concerning polyominoes, Fibonacci Quarterly 3 (1965), 9–20.Google Scholar
(8) Otter, R., The number of trees, Ann. of Math. (2) 49 (1948), 583–599.CrossRefGoogle Scholar
(9) Pólya, G., Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Math. 68 (1937), 145–354.Google Scholar
(10) Titchmarsh, E. C., Theory of Functions, 2nd edition (Oxford University Press, 1939).Google Scholar
(11) Harary, F., Graph Theory (Addison-Wesley, Reading, Mass., 1969).Google Scholar