6 citations · 9 across the 7 of their papers we have counts for
7 papers
Mutually avoiding Eulerian circuits
Grahame Erskine, Terry Griggs, Robert Lewis +1
Two Eulerian circuits, both starting and ending at the same vertex, are avoiding if at every other point of the circuits they are at least distance 2 apart. An Eulerian graph which…
The degree-diameter problem for circulant graphs of degrees 10 and 11 - extended version
Robert R Lewis
This paper considers the degree-diameter problem for undirected circulant graphs. For degrees 10 and 11 newly discovered families of circulant graphs of arbitrary diameter are pres…
Improved upper bounds for the order of some classes of Abelian Cayley and circulant graphs of diameter two
Robert R. Lewis
In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for al…
Large circulant graphs of fixed diameter and arbitrary degree
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…
Distance partitions of extremal and largest known circulant graphs of degree 2 to 9
Robert Lewis
This paper considers the degree-diameter problem for extremal and largest known undirected circulant graphs of degree 2 to 9 of arbitrary diameter. As these graphs are vertex trans…
Full Proof of the Existence of a Degree 8 Circulant graph of Order L(8,k) of Arbitrary Diameter k
Robert Lewis
This is the full proof of Theorem 3 on the existence of the largest known degree 8 circulant graph for all diameters stated in the paper "The degree-diameter problem for circulant…
The Degree-Diameter Problem for Circulant Graphs of Degree 8 and 9
Robert Lewis
This paper considers the degree-diameter problem for undirected circulant graphs. The focus is on extremal graphs of given (small) degree and arbitrary diameter. The published lite…