z-logo
open-access-imgOpen Access
Modular Leech Trees of Order at Most 8
Author(s) -
David Leach
Publication year - 2014
Publication title -
international journal of combinatorics
Language(s) - English
Resource type - Journals
eISSN - 1687-9171
pISSN - 1687-9163
DOI - 10.1155/2014/218086
Subject(s) - algorithm , computer science , artificial intelligence
In 1975, John Leech asked when can the edges of a tree on vertices be labeled with positive integers such that the sums along the paths are exactly the integers . He found five such trees, and no additional trees have been discovered since. In 2011 Leach and Walsh introduced the idea of labeling trees with elements of the group where and examined the cases for . In this paper we show that no modular Leech trees of order 7 exist, and we find all modular Leech trees of order 8.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom