MeredithGraph - Maple Help

GraphTheory[SpecialGraphs]

 MeredithGraph
 construct Meredith graph

 Calling Sequence MeredithGraph()

Description

 • The MeredithGraph command creates the Meredith graph.
 • The Meredith graph is a 4-regular distance-transitive graph with 70 vertices and 140 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{MeredithGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 70 vertices and 140 edge\left(s\right)}}$ (1)
 > $\mathrm{IsRegular}\left(G\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{ChromaticNumber}\left(G\right)$
 ${3}$ (3)

References

 "Meredith graph", Wikipedia. http://en.wikipedia.org/wiki/Meredith_graph

Compatibility

 • The GraphTheory[SpecialGraphs][MeredithGraph] command was introduced in Maple 2020.