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).

In addition suitable contents:
[ 2 ] [ = ] [ am ] [ an ] [ ar ] [ arc ] [ b ] [ bo ] [ ch ] [ co ] [ com ] [ complete ] [ complete graph ] [ de ] [ degree ] [ diameter ] [ disc ] [ du ] [ ed ] [ ee ] [ eg ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ gr ] [ graph ] [ gu ] [ h ] [ hr ] [ id ] [ ie ] [ il ] [ is ] [ la ] [ Lex ] [ ly ] [ M ] [ meter ] [ mo ] [ mod ] [ module ] [ Moore bound ] [ mp ] [ na ] [ no ] [ node ] [ om ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ regular graph ] [ sc ] [ se ] [ si ] [ T ] [ th ] [ ve ]