Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7642
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Laszlo A. Szekely | - |
dc.contributor.author | Hua Wang | - |
dc.date.accessioned | 2024-02-27T06:20:41Z | - |
dc.date.available | 2024-02-27T06:20:41Z | - |
dc.date.issued | 2005 | - |
dc.identifier.uri | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7642 | - |
dc.description.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. | - |
dc.publisher | Bulletin of the Institute of Combinatorics and Its Applications | - |
dc.title | Some Non-Existence Results on Leech Trees | - |
dc.vol | Vol 44 | - |
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.