Folkman graph
graph with 20 vertices and 40 edges, the smallest semi-symmetric graph
Press Enter · cited answer in seconds
0 sources
Folkman graph
Summary
Folkman graph is a semi-symmetric graph[1]. It draws 3 Wikipedia views per month (semi_symmetric_graph category, ranking #1 of 1).[2]
Key Facts
- Folkman graph's image is recorded as Folkman graph alt.svg[3].
- Folkman graph's instance of is recorded as semi-symmetric graph[4].
- Folkman graph's instance of is recorded as bipartite graph[5].
- Folkman graph's instance of is recorded as Hamiltonian graph[6].
- Folkman graph's instance of is recorded as quartic graph[7].
- Folkman graph's instance of is recorded as perfect graph[8].
- Folkman graph's instance of is recorded as Eulerian graph[9].
- Jon Folkman is named after Folkman graph[10].
- Folkman graph's Commons category is recorded as Folkman graph[11].
- Folkman graph's Freebase ID is recorded as /m/06znpxs[12].
- Folkman graph's studied by is recorded as graph theory[13].
- Folkman graph's has part is recorded as node[14].
- Folkman graph's has part is recorded as edge[15].
- Folkman graph's MathWorld ID is recorded as FolkmanGraph[16].
- Folkman graph's Wolfram Language entity code is recorded as Entity["Graph", "FolkmanGraph"][17].
- Folkman graph's maintained by WikiProject is recorded as WikiProject Mathematics[18].
- Folkman graph's graph radius is recorded as {'amount': '+3'}[19].
- Folkman graph's graph diameter is recorded as {'amount': '+4'}[20].
- Folkman graph's graph girth is recorded as {'amount': '+4'}[21].
- Folkman graph's The House of Graphs ID is recorded as 1079[22].
Why It Matters
Folkman graph draws 3 Wikipedia views per month (semi_symmetric_graph category, ranking #1 of 1).[2] It has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.[23]