Hall–Janko graph
highly-symmetric node-link graph with 100 vertices and 36 edges per vertex
Facts
7 properties- Instance of
- undirected graph, strongly regular graph, vertex-transitive graph, Cayley graph, Hamiltonian graph, integral graph, Eulerian graph, mathematical concept[2][3][4][5][6][7][8]
- Graph diameter
- 2[16]
- Graph girth
- 3[17]
- Graph radius
- 2[15]
- Named after
- Zvonimir Janko, Marshall Hall[9][10]
- Studied by
- graph theory[11]
🏷️ Also known as
en Hall-Janko graph
en Hall–Janko graph
en Hall-Janko-Wales graph
fr graphe de Hall-Janko
pt grafo de Hall–Janko
ru граф Холла — Янко
ru граф Холла — Янко — Уэлса
ru граф Холла-Янко-Уэлса
uk граф Голла — Янко
uk граф Голла — Янко — Велза
uk граф Холла — Янко
🔖 Identifiers · 7
- Image (Wikimedia Commons)
- Hall janko graph.svg ↗
- Described at URL
- aeb.win.tue.nl
- Freebase ID
- /m/046xg6
- MathWorld ID
- Hall-JankoGraph
- Microsoft Academic ID (discontinued)
- 2780281801
- The House of Graphs ID
- 1140
- Wolfram Language entity code
- Entity["Graph", "HallJankoGraph"]
🔗 Connections
Instance of 7
Named after 2
Created notable works 1
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Hall–Janko graph is an undirected graph[1].