A graph which achieves the Moore bound. These are complete graphs, polygon graphs (regular graphs of degree 2) and three others: (nodes, degree, diameter) = (10,3,2), (50,7,2) and the possible but undiscovered (3250,57,2).
Updated: Wed Oct 26 16:27:59 2016
No longer supported by Imperial
College Department of Computing
Copyright Denis Howe 1985