Abstract
Several special types of Leech trees are investigated in this note. In particular, it is shown that there is no diameter-3 Leech tree of order n ≥ 7, and there are at most finitely many diameter-4 Leech trees. A result of Székely, Wang, and Zhang on maximum degree of a vertex in a Leech tree is also improved. © 2024 MSP (Mathematical Sciences Publishers).
| Original language | English |
|---|---|
| Pages (from-to) | 327-335 |
| Journal | Involve |
| Volume | 17 |
| Issue number | 2 |
| Online published | 20 May 2024 |
| DOIs | |
| Publication status | Published - 2024 |
Research Keywords
- graph labeling
- Leech tree
- Sidon sets
Fingerprint
Dive into the research topics of 'A graph labeling problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver