Another Tree Labelling Problem
From MaRDI portal
Cited in
(12)- A distinct distance set of 9 nodes in a tree of diameter 36
- On prime labellings
- On Additive Bases and Harmonious Graphs
- Modular Leech trees of order at most 8
- Two classes of non-Leech trees
- Leech index of a tree
- Two extensions of Leech labeling to the class of all graphs
- Leech graphs
- On Leech labelings of graphs and some related concepts
- A graph labeling problem
- Geodesic Leech graphs
- An edge labeling of graphs from Rado's partition regularity condition
This page was built for publication: Another Tree Labelling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083451)