LivingstoneGraph - Maple Help

GraphTheory[SpecialGraphs]

 LivingstoneGraph
 construct Livingstone graph

 Calling Sequence LivingstoneGraph()

Description

 • The LivingstoneGraph() command returns the Livingstone graph, a distance-transitive graph with 266 vertices and 198 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{LivingstoneGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 266 vertices and 198 edge\left(s\right)}}$ (1)
 > $\mathrm{ChromaticNumber}\left(G\right)$
 ${3}$ (2)

References

 "Livingstone graph", Wikipedia. http://en.wikipedia.org/wiki/Livingstone_graph

Compatibility

 • The GraphTheory[SpecialGraphs][LivingstoneGraph] command was introduced in Maple 2019.