Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7642
Title: | Some Non-Existence Results on Leech Trees |
Authors: | Laszlo A. Szekely Hua Wang |
Issue Date: | 2005 |
Publisher: | Bulletin of the Institute of Combinatorics and Its Applications |
Abstract: | More than 25 years ago John Leech [2] posed the following beautiful problem- find, whenever possible, trees on n vertices with positive weights on the edges, such that the weighted distances among the n vertices are exactly the numbers 1, 2, 3, ... , . This paper makes a modest progress on this problem. |
URI: | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7642 |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Some non-existence results on Leech trees.pdf Restricted Access | 1.89 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.