GrinbergGraph - Maple Help

GraphTheory[SpecialGraphs]

 GrinbergGraph
 construct Grinberg graph

 Calling Sequence GrinbergGraph()

Description

 • The GrinbergGraph() command returns the Grinberg graph with 46 vertices,
 • This graph is an example of a 3-connected cubic graph which is not Hamiltonian.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{GrinbergGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 46 vertices and 69 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(G\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{DegreeSequence}\left(G\right)$
 $\left[{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}{,}{3}\right]$ (3)
 > $\mathrm{DrawGraph}\left(G\right)$