GraphTheory[SpecialGraphs]
RobertsonGraph
construct Robertson graph
Calling Sequence
Description
Examples
References
RobertsonGraph()
The RobertsonGraph() command returns the Robertson graph, a 4-regular undirected graph with 19 vertices and 38 edges.
withGraphTheory:
withSpecialGraphs:
G≔RobertsonGraph
G≔Graph 1: an undirected graph with 19 vertices and 38 edge(s)
IsBipartiteG
false
DrawGraphG
"Robertson graph", Wikipedia. http://en.wikipedia.org/wiki/Robertson_graph
See Also
CageGraph
RobertsonWegnerGraph
SpecialGraphs
Download Help Document