1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
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 FieldValueLanguage
dc.contributor.authorLaszlo A. Szekely-
dc.contributor.authorHua Wang-
dc.date.accessioned2024-02-27T06:20:41Z-
dc.date.available2024-02-27T06:20:41Z-
dc.date.issued2005-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7642-
dc.description.abstractMore 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.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleSome Non-Existence Results on Leech Trees-
dc.volVol 44-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
Some non-existence results on Leech trees.pdf
  Restricted Access		1.89 MBAdobe PDFView/Open Request a copy
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.