5 citations · 8 across the 27 of their papers we have counts for
4 papers · 1 filter
On diregular digraphs with degree two and excess three
James Tuite
Moore digraphs, that is digraphs with out-degree , diameter and order equal to the Moore bound , arise in the study of optimal network top…
Large Cayley graphs of small diameter
Grahame Erskine, James Tuite
The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for r…
On diregular digraphs with degree two and excess two
James Tuite
An important topic in the design of efficient networks is the construction of -digraphs, i.e. -geodetic digraphs with minimum out-degree and order …
Digraphs with degree two and excess two are diregular
James Tuite
A -geodetic digraph with minimum out-degree has excess if it has order , where represents the Moore bound for out-degree and diameter . For g…