Modular Leech trees of order at most 8

DOI10.1155/2014/218086zbMath1302.05034OpenAlexW2023498683WikidataQ59043530 ScholiaQ59043530MaRDI QIDQ471788

David Leach

Publication date: 17 November 2014

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/218086

zbMATH Keywords

treepath sumedge labellinglabellings from abelian groups

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items (4)

Leech index of a tree ⋮ Two extensions of Leech labeling to the class of all graphs ⋮ Unnamed Item ⋮ Two classes of non-Leech trees

Cites Work

• 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

This page was built for publication: Modular Leech trees of order at most 8