Some Non-Existence Results on Leech Trees

Laszlo A. Székely; Hua Wang; Yong Zhang

Some Non-Existence Results on Leech Trees

Laszlo A. Székely, Hua Wang, Yong Zhang

Mathematical Sciences

University of South Carolina

Research output: Contribution to journal › Article › peer-review

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.

Original language	American English
Journal	Bulletin of the Institute of Combinatorics and its Applications
Volume	44
State	Published - May 2005

Keywords

Leech trees

DC Disciplines

Mathematics

Cite this

@article{18e692dbcf56489fa380f389786e0c82,

title = "Some Non-Existence Results on Leech Trees",

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",

author = "Sz{\'e}kely, {Laszlo A.} and Hua Wang and Yong Zhang",

year = "2005",

month = may,

language = "American English",

volume = "44",

journal = "Bulletin of the Institute of Combinatorics and its Applications",

issn = "1183-1278",

publisher = "Institute of Combinatorics and its Applications",

}

TY - JOUR

T1 - Some Non-Existence Results on Leech Trees

AU - Székely, Laszlo A.

AU - Wang, Hua

AU - Zhang, Yong

PY - 2005/5

Y1 - 2005/5

N2 - 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.

AB - 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.

KW - Leech trees

UR - http://people.math.sc.edu/laszlo/leech7.pdf

M3 - Article

SN - 1183-1278

VL - 44

JO - Bulletin of the Institute of Combinatorics and its Applications

JF - Bulletin of the Institute of Combinatorics and its Applications

ER -

Some Non-Existence Results on Leech Trees

Abstract

Keywords

DC Disciplines

Other files and links

Fingerprint

Cite this