activity
20142026
most citedA revised Moore bound for mixed graphs

22 citations · 46 across the 20 of their papers we have counts for

collaborators
Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 22 cited

A revised Moore bound for mixed graphs

Dominique Buset, Mourad El Amiri, Grahame Erskine +2

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 v…

math.CO2015

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…