22 citations · 51 across the 8 of their papers we have counts for
Showing 2015 · math.COShow all
2 papers · 2 filters
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★ 3 cited
Searching for Large Circulant Graphs
Ramiro Feria-Puron, Hebert Perez-Roses, Joe Ryan
We address the problem of constructing large undirected circulant networks with given degree and diameter. First we discuss the theoretical upper bounds and their asymptotics, and…