On Moore Graphs with Diameters 2 and 3

This note treats the existence of connected, undirected graphs homogeneous of degree d and of diameter k, having a number of nodes which is maximal according to a certain definition. For k = 2 unique graphs exist for d = 2,3,7 and possibly for d = 57 (which is undecided), but for no other degree. Fo... View More