A distinct distance set of 9 nodes in a tree of diameter 36

DOI10.1016/0012-365X(91)90252-WzbMath0755.05087MaRDI QIDQ1182890

Herbert Taylor

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treedistinct distance set

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Leech index of a tree ⋮ On distinct distance sets in a graph ⋮ Two extensions of Leech labeling to the class of all graphs ⋮ Unnamed Item ⋮ Modular Leech trees of order at most 8 ⋮ Two classes of non-Leech trees

Cites Work

• Distinct distance sets in a graph
• Odd Path Sums in an Edge-Labeled Tree
• Another Tree Labelling Problem

This page was built for publication: A distinct distance set of 9 nodes in a tree of diameter 36