Skip to main content
Article
Some Non-Existence Results on Leech Trees
Bulletin of the Institute of Combinatorics and Its Applications (2005)
  • Laszlo A. Székely, University of South Carolina
  • Hua Wang, Georgia Southern University
  • Yong Zhang, University of South Carolina
Abstract
More than 25 years ago John Leech [2] published the following beautiful problem: find, whenever possible, trees on n vertices with positive weights on the edges, such that the (n/2) weighted distances among the n vertices are exactly the numbers 1, 2, 3, ..., (n/2). This paper makes a modest progress on this problem.
Keywords
  • Leech trees
Disciplines
Publication Date
May, 2005
Citation Information
Laszlo A. Székely, Hua Wang and Yong Zhang. "Some Non-Existence Results on Leech Trees" Bulletin of the Institute of Combinatorics and Its Applications Vol. 44 (2005) p. 37 - 45
Available at: http://works.bepress.com/hua_wang/139/