5 citations · 8 across the 27 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 1 cited
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…
math.CO2021
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…
math.CO2021
On some extremal position problems for graphs
James Tuite, Elias John Thomas, Ullas Chandran S. V.
The general position number of a graph is the size of the largest set of vertices such that no geodesic of contains more than two elements of . The monophonic positi…