Higman–Sims graph
highly-symmetric node-link graph with 100 vertices and 22 edges per vertex
Facts
6 properties- Instance of
- Cayley graph, strongly regular graph, edge-transitive graph, Hamiltonian graph, integral graph, Eulerian graph, mathematical concept, triangle-free graph[2][3][4][5][6][7][8]
- Graph diameter
- 2[14]
- Graph girth
- 4[15]
- Graph radius
- 2[13]
- Studied by
- graph theory[9]
🏷️ Also known as
en Higman-Sims graph
en Higman–Sims graph
fr graphe de Higman-Sims
hu Higman–Sims-gráf
ja ヒグマン–シムスグラフ
ko 히그만–심즈 그래프
pt Grafo de Higman-Sims
pt Grafo de Higman–Sims
ru граф Хигмана — Симса
ru граф Хигмена-Симса
uk граф Гіґмана — Сімса
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Higman Sims Graph.svg ↗
- Described at URL
- aeb.win.tue.nl
- Freebase ID
- /m/046wx0
- MathWorld ID
- Higman-SimsGraph
- Microsoft Academic ID (discontinued)
- 2778707469
- The House of Graphs ID
- 1165
- Wolfram Language entity code
- Entity["Graph", "HigmanSimsGraph"]
🔗 Connections
Instance of 7
Created notable works 1
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Higman–Sims graph is a Cayley graph[1].