Hoffman–Singleton graph (Q3090387)
Jump to navigation
Jump to search
node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5
Language | Label | Description | Also known as |
---|---|---|---|
English | Hoffman–Singleton graph |
node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5 |
Statements
2
0 references
Hoffman-Singleton graph
0 references
Identifiers
Sitelinks
Wikipedia(9 entries)
- enwiki Hoffman–Singleton graph
- frwiki Graphe de Hoffman-Singleton
- jawiki ホフマン–シングルトングラフ
- kowiki 호프만–싱글턴 그래프
- plwiki Graf Hoffmana-Singletona
- ptwiki Grafo de Hoffman-Singleton
- ruwiki Граф Хоффмана — Синглтона
- slwiki Hoffman-Singletonov graf
- ukwiki Граф Гофмана — Синглтона
Wikibooks(0 entries)
Wikinews(0 entries)
Wikiquote(0 entries)
Wikisource(0 entries)
Wikiversity(0 entries)
Wikivoyage(0 entries)
Wiktionary(0 entries)
Multilingual sites(1 entry)
- commonswiki Category:Hoffman-Singleton graph