6 citations · 8 across the 3 of their papers we have counts for
3 papers
math.CO2014★ 1 cited
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…
math.CO2014★ 1 cited
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…
math.CO2014★ 6 cited
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…