Hoffman–Singleton graph
node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5
Facts
7 properties- Instance of
- Hamiltonian graph, Hamilton-connected graph, strongly regular graph, cage, Moore graph, integral graph, geodetic graph, square-free graph, triangle-free graph[2][3][4][5][6][7][8][9]
- Graph diameter
- 2[16]
- Graph girth
- 5[17]
- Graph radius
- 2[15]
- Named after
- Alan Hoffman[10]
- Studied by
- graph theory[11]
🏷️ Also known as
en Hoffman-Singleton graph
en Hoffman–Singleton graph
fr Graphe de Hoffman-Singleton
fr Graphe d'Hoffman-Singleton
hu Hoffman–Singleton-gráf
ja ホフマン-シングルトングラフ
ko 호프만–싱글턴 그래프
pl Graf Hoffmana-Singletona
pt Grafo de Hoffman-Singleton
pt Grafo de Hoffman–Singleton
ru граф Хоффмана — Синглтона
uk граф Гофмана-Синглтона
zh Hoffman-Singleton圖
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Hoffman singleton graph circle2.gif ↗
- Described at URL
- aeb.win.tue.nl
- Freebase ID
- /m/0bjscr
- MathWorld ID
- Hoffman-SingletonGraph
- Microsoft Academic ID (discontinued)
- 2779657114
- The House of Graphs ID
- 1173
- Wolfram Language entity code
- Entity["Graph", "HoffmanSingletonGraph"]
🔗 Connections
Instance of 6
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Hoffman–Singleton graph is a Hamiltonian graph[1].