Dyck graph
node-link graph, the only cubic symmetric graph on 32 vertices
Facts
7 properties- Instance of
- Hamiltonian graph, symmetric graph, cubic graph, bipartite graph, Cayley graph, toroidal graph, square-free graph, triconnected graph[2][3][4][5][6][7][8]
- Graph diameter
- 5[15]
- Graph girth
- 6[16]
- Graph radius
- 5[14]
- Named after
- Walther von Dyck[9]
- Studied by
- graph theory[10]
🏷️ Also known as
en Dyck graph
es Grafo de Dyck
fr graphe de Dyck
ja ディックグラフ
ru граф Дика
uk граф Діка
🔖 Identifiers · 6
- Image (Wikimedia Commons)
- Dyck graph hamiltonian.svg ↗
- Described at URL
- aeb.win.tue.nl
- Freebase ID
- /m/07kftw1
- MathWorld ID
- DyckGraph
- The House of Graphs ID
- 1053
- Wolfram Language entity code
- Entity["Graph", "DyckGraph"]
🔗 Connections
Instance of 6
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Dyck graph is a Hamiltonian graph[1].