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).
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive
Singleton, There is no irregular moore graph, Amer.
All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.