|
|||||
 |
|
|
|
|
|
|
|
A graph
labeling problem
Tao Luo and Leah Yu |
|
Vol. 17 (2024), No. 2, 327–335
|
Abstract |
|
Several special types of Leech trees are investigated in this note. In particular, it is shown that there is no diameter- Leech tree of order , and there are at most finitely many diameter- Leech trees. A result of Székely, Wang, and Zhang on maximum degree of a vertex in a Leech tree is also improved. |
PDF Access Denied
We have not been able to recognize your IP address
3.128.205.110
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form. Or, visit our subscription page for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for USD 30.00:
Keywords
graph labeling, Leech tree, Sidon sets
|
Mathematical Subject Classification
Primary: 05C05, 05C78, 11B83
|
Milestones
Received: 11 January 2023
Revised: 3 May 2023
Accepted: 5 May 2023
Published: 20 May 2024
Communicated by Kenneth S. Berenhaut
|
Authors |
| Tao Luo | |
| Department of Mathematics City University of Hong Kong Kowloon Hong Kong |
|
| Leah Yu | |
| Centerville High School Centerville, OH United States |
|
| © 2024 MSP (Mathematical Sciences Publishers). |
