Grahame Erskine

Learn More
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity is focussed on finding new examples of graphs or families of graph with orders approaching the bound as closely as(More)
(2017). Large circulant graphs of fixed diameter and arbitrary degree. Ars Mathematica Contemporanea, 13(2) (Early view). Abstract 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 given diameter have concentrated mainly on the(More)
Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Abstract. We consider the degree-diameter problem for Cayley graphs of dihedral groups. We find upper and lower(More)
  • 1