Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840637n
Noun Named Entity
SYL
No term available
EN
The Sylvester graph is the unique distance-regular graph with intersection array { 5, 4, 2 ; 1, 1, 4 } {\displaystyle \{5,4,2;1,1,4\}}. Wikipedia
Relations
Sources
IS A
EN
symmetric graph
EN
Hamiltonian path
EN
integral graph
EN
Cayley graph
EN
distance-regular graph
PART OF
EN
Hoffman–Singleton graph
HAS PARTS OF THE CLASS
EN
vertex
EN
edge
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