Hostname: page-component-7479d7b7d-rvbq7 Total loading time: 0 Render date: 2024-07-12T12:49:53.917Z Has data issue: false hasContentIssue false
  • English
  • Français

The asymptotic expansion of the number of tree-like polyhexes†

Published online by Cambridge University Press:  20 January 2009

E. M. Wright
E. M. Wright
Affiliation:
University of Aberdeen
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.

We refer to (1) for the definitions of Un and Hn. Our object is to find asymptotic expansions for Un and Hn for large n. This enables us to improve the approximations to Un and Hn for large n found in the last two pages of (1).

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 17 , Issue 3 , June 1971 , pp. 281 - 282
Copyright
Copyright © Edinburgh Mathematical Society 1971

References

REFERENCES

(1)Harary, F. and Read, R. C., The enumeration of tree-like polyhexes, Proc. Edinburgh Math. Soc. (2) 17 (1970), 1–13.CrossRefGoogle Scholar
(2)Trrchmarsh, E. C., Theory of functions 2nd edition (Oxford, 1939), 224.Google Scholar