Two classes of non-Leech trees

DOI10.5614/ejgta.2020.8.1.15zbMath1468.05273OpenAlexW3015064862MaRDI QIDQ4957983

No author found.

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2020.8.1.15

zbMATH Keywords

Leech treeLeech labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Two extensions of Leech labeling to the class of all graphs ⋮ Unnamed Item

Cites Work

• Modular Leech trees of order at most 8
• A distinct distance set of 9 nodes in a tree of diameter 36
• Odd Path Sums in an Edge-Labeled Tree
• Another Tree Labelling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two classes of non-Leech trees