Dyck graph
From Wikipedia, the free encyclopedia
In the mathematical field of graph theory, the Dyck graph is a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck.[1][2]
Quick Facts Named after, Vertices ...
Dyck graph | |
---|---|
Named after | W. Dyck |
Vertices | 32 |
Edges | 48 |
Radius | 5 |
Diameter | 5 |
Girth | 6 |
Automorphisms | 192 |
Chromatic number | 2 |
Chromatic index | 3 |
Book thickness | 3 |
Queue number | 2 |
Properties | Symmetric Cubic Hamiltonian Bipartite Cayley graph |
Table of graphs and parameters |
Close
It is Hamiltonian with 120 distinct Hamiltonian cycles. It has chromatic number 2, chromatic index 3, radius 5, diameter 5 and girth 6. It is also a 3-vertex-connected and a 3-edge-connected graph. It has book thickness 3 and queue number 2.[3]
The Dyck graph is a toroidal graph; the dual of its symmetric toroidal embedding is the Shrikhande graph.