Folkman graph
graph with 20 vertices and 40 edges, the smallest semi-symmetric graph
Facts
7 properties- Instance of
- semi-symmetric graph, bipartite graph, Hamiltonian graph, quartic graph, perfect graph, Eulerian graph[1][2][3][4][5]
- Graph diameter
- 4[12]
- Graph girth
- 4[13]
- Graph radius
- 3[11]
- Named after
- Jon Folkman[6]
- Studied by
- graph theory[7]
🏷️ Also known as
en Folkman graph
fr graphe de Folkman
hu Folkman-gráf
it grafo di Folkman
ja フォークマングラフ
pt Grafo de Folkman
ru граф Фолкмена
🔖 Identifiers · 5
- Image (Wikimedia Commons)
- Folkman graph alt.svg ↗
- Freebase ID
- /m/06znpxs
- MathWorld ID
- FolkmanGraph
- The House of Graphs ID
- 1079
- Wolfram Language entity code
- Entity["Graph", "FolkmanGraph"]
🔗 Connections
Instance of 6
Maintained by WikiProject 1
Studied by 1
Press Enter · cited answer in seconds