GraphTheory[SpecialGraphs] - Maple Programming Help

Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/RobertsonGraph

GraphTheory[SpecialGraphs]

 RobertsonGraph
 construct Robertson graph

 Calling Sequence RobertsonGraph()

Description

 • The RobertsonGraph() command returns the Robertson graph, a 4-regular undirected graph with 19 vertices and 38 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{RobertsonGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 19 vertices and 38 edge\left(s\right)}}$ (1)
 > $\mathrm{IsBipartite}\left(G\right)$
 ${\mathrm{false}}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Robertson graph", Wikipedia. http://en.wikipedia.org/wiki/Robertson_graph