Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03144324n
Noun Concept
SYL
No term available
EN
In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. Wikipedia
Relations
Sources
IS A
EN
strongly regular graph
EN
Hamiltonian path
EN
integral graph
EN
Moore graph
EN
cage
HAS PART
EN
Sylvester graph
HAS PARTS OF THE CLASS
EN
vertex
EN
edge
NAMED AFTER
EN
Alan Hoffman
STUDIED BY
EN
graph theory

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License