Table of Contents
International Journal of Combinatorics
Volume 2014 (2014), Article ID 218086, 2 pages
http://dx.doi.org/10.1155/2014/218086
Research Article

Modular Leech Trees of Order at Most 8

Department of Mathematics, University of West Georgia, 1601 Maple Street, Carrollton, GA 30118, USA

Received 11 August 2014; Accepted 2 September 2014; Published 18 September 2014

Academic Editor: Laszlo A. Szekely

Copyright © 2014 David Leach. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Leech, “Research problems: another tree labelling problem,” The American Mathematical Monthly, vol. 82, no. 9, pp. 923–925, 1975. View at Publisher · View at Google Scholar · View at MathSciNet
  2. H. Taylor, “Odd path sums in an edge-labeled tree,” Mathematics Magazine, vol. 50, no. 5, pp. 258–259, 1977. View at Publisher · View at Google Scholar · View at MathSciNet
  3. H. Taylor, “A distinct distance set of 9 nodes in a tree of diameter 36,” Discrete Mathematics, vol. 93, no. 2-3, pp. 167–168, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. L. A. Székely, H. Wang, and Y. Zhang, “Some non-existence results on Leech trees,” Bulletin of the Institute of Combinatorics and its Applications, vol. 44, pp. 37–45, 2005. View at Google Scholar · View at MathSciNet
  5. B. Calhoun, K. Ferland, L. Lister, and J. Polhill, “Minimal distinct distance trees,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 61, pp. 33–57, 2007. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. D. Leach and M. Walsh, “Generalized Leech trees,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 78, pp. 15–22, 2011. View at Google Scholar · View at MathSciNet · View at Scopus