1 paper
David Bevan, Grahame Erskine, Robert Lewis
We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a giv…