Gewirtz graph
strongly regular graph with 56 vertices and valency 10
Press Enter · cited answer in seconds
0 sources
Gewirtz graph
Summary
Gewirtz graph is a Hamiltonian graph[1]. It draws 4 Wikipedia views per month (hamiltonian_graph category, ranking #7 of 8).[2]
Key Facts
- Gewirtz graph's image is recorded as Gewirtz graph embeddings.svg[3].
- Gewirtz graph's instance of is recorded as Hamiltonian graph[4].
- Gewirtz graph's instance of is recorded as strongly regular graph[5].
- Gewirtz graph's instance of is recorded as triangle-free graph[6].
- Gewirtz graph's instance of is recorded as vertex-transitive graph[7].
- Gewirtz graph's instance of is recorded as edge-transitive graph[8].
- Gewirtz graph's instance of is recorded as distance-transitive graph[9].
- Gewirtz graph's instance of is recorded as Eulerian graph[10].
- Gewirtz graph's Commons category is recorded as Gewirtz graph[11].
- Gewirtz graph's Freebase ID is recorded as /m/09v1k81[12].
- Gewirtz graph's described at URL is recorded as https://aeb.win.tue.nl/graphs/Sims-Gewirtz.html[13].
- Gewirtz graph's studied by is recorded as graph theory[14].
- Gewirtz graph's has part is recorded as node[15].
- Gewirtz graph's has part is recorded as edge[16].
- Gewirtz graph's MathWorld ID is recorded as GewirtzGraph[17].
- Gewirtz graph's Wolfram Language entity code is recorded as Entity["Graph", "GewirtzGraph"][18].
- Gewirtz graph's maintained by WikiProject is recorded as WikiProject Mathematics[19].
- Gewirtz graph's graph radius is recorded as {'amount': '+2'}[20].
- Gewirtz graph's graph diameter is recorded as {'amount': '+2'}[21].
- Gewirtz graph's graph girth is recorded as {'amount': '+4'}[22].
- Gewirtz graph's The House of Graphs ID is recorded as 1102[23].
Why It Matters
Gewirtz graph draws 4 Wikipedia views per month (hamiltonian_graph category, ranking #7 of 8).[2]