GraphTheory[SpecialGraphs]
GrinbergGraph
construct Grinberg graph
Calling Sequence
Description
Examples
GrinbergGraph()
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.
withGraphTheory:
withSpecialGraphs:
G≔GrinbergGraph
G≔Graph 1: an undirected graph with 46 vertices and 69 edge(s)
IsPlanarG
true
DegreeSequenceG
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
DrawGraphG
See Also
CageGraph
CoxeterGraph
SpecialGraphs
Download Help Document