Hoffman graph
4-regular graph with 16 vertices and 32 edges
Facts
7 properties- Instance of
- bipartite graph, integral graph, Hamiltonian graph, perfect graph, k-vertex-connected graph, k-edge-connected graph, undirected graph, quartic graph[2][3][4][5][6][7][8]
- Graph diameter
- 4[15]
- Graph girth
- 4[16]
- Graph radius
- 3[14]
- Named after
- Alan Hoffman[9]
- Studied by
- graph theory[10]
🏷️ Also known as
en Hoffman graph
fr graphe de Hoffman
ja ホフマングラフ
ko 호프먼 그래프
ru граф Хофмана
ru граф Хоффмана
uk граф Гофмана
uk граф Гоффмана
🔖 Identifiers · 6
- Image (Wikimedia Commons)
- Hoffman graph.svg ↗
- Freebase ID
- /m/07k959w
- MathWorld ID
- HoffmanGraph
- Microsoft Academic ID (discontinued)
- 2781418291
- The House of Graphs ID
- 1167
- Wolfram Language entity code
- Entity["Graph", "HoffmanGraph"]
🔗 Connections
Instance of 9
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Hoffman graph is a bipartite graph[1].