1 citations · 1 across the 3 of their papers we have counts for
4 papers
Small graphs and hypergraphs of given degree and girth
Grahame Erskine, James Tuite
The search for the smallest possible -regular graph of girth has a long history, and is usually known as the cage problem. This problem has a natural extension to hypergraph…
The structure of digraphs with excess one
James Tuite
A digraph is \emph{-geodetic} if for any (not necessarily distinct) vertices there is at most one directed walk from to with length not exceeding . The orde…
On networks with order close to the Moore bound
James Tuite, Grahame Erskine
The degree/diameter problem for mixed graphs asks for the largest possible order of a mixed graph with given diameter and degree parameters. Similarly the \emph{degree/geodecity} p…
On total regularity of mixed graphs with order close to the Moore bound
James Tuite, Grahame Erskine
The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently su…