MatematicaInglese
Pubblicato in Math ∩ Programming
Autore Jeremy Kun
For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth.