Abstract: | We deal with connected -regular multigraphs of order that has only three distinct eigenvalues. In this paper, we study the largest possible number of vertices of such a graph for given . For , the Moore graphs are largest. For , we show an upper bound , with equality if and only if there exists a finite projective plane of order that admits a polarity. |