DyckGraph - Maple Help

GraphTheory[SpecialGraphs]

 DyckGraph
 construct Dyck graph

 Calling Sequence DyckGraph()

Description

 • The DyckGraph() command returns the Dyck graph, a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{DyckGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 32 vertices and 48 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(G\right)$
 ${\mathrm{false}}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Dyck graph", Wikipedia. http://en.wikipedia.org/wiki/Dyck_graph