Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:04840637n
Noun Named Entity
JA
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
対称グラフ
ハミルトン路
整数
ケイリーグラフ
距離正則グラフ
PART OF
ホフマン-シングルトングラフ
HAS PARTS OF THE CLASS
頂点
EN
edge
STUDIED BY
グラフ理論

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