References
- D. Anandhababu and N. Parvathi, Construction of Halin graph with perfect k-ary tree and its independent domination number, Journal of Discrete Mathematical Sciences and Cryptography, 22(6) (2019), 1101–1106. doi: 10.1080/09720529.2019.1689607
- B. Calhoun and J. Polhill, Perfect distinct distance forests, Australasian Journal of Combinatorics, 42 (2008), 211–222.
- B. Calhoun, K. Ferland, L. Lister, and J. Polhill, Minimal distinct distance trees, J. Combin. Math. Combin. Comput., 61 (2007), 33–57.
- G. Chartrand and L. Lesniak, Graphs and digraphs, CRC (2005).
- D. Leach, Modular Leech trees of order atmost 8, J. Combin., (2014), Article ID 218086.
- D. Leach and M. Walsh, Generalized Leech trees, J. Combin. Math. Combin. Comput., 78 (2011), 15–22.
- J. Leech, Another tree labeling problem, Amer. Math. Monthly, 82 (1975), 923–925. doi: 10.1080/00029890.1975.11993981
- M. Ozen, H. Wang, D. Yalman, Note on Leech-type questions of tree, Integers 16 (2016), 1–8
- L.A. Szekely, H. Wang, and Y. Zhang, Some non-existence results on Leech trees, Bull. Inst. C ombin. Appl., 44 (2005), 37–45.
- H. Taylor, Odd path sums in an edge-labeled tree, Math. Magazine, 50(5) (1977), 258–259. doi: 10.1080/0025570X.1977.11976658
- H. Taylor, A distinct distance set of 9 nodes in a tree of diameter 36, Discrete Math., 93 (1991), 167–168. doi: 10.1016/0012-365X(91)90252-W