GraphTheory[SpecialGraphs] - Maple Programming Help

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

GraphTheory[SpecialGraphs]

 GewirtzGraph
 construct Gewirtz graph

 Calling Sequence GewirtzGraph()

Description

 • The GewirtzGraph command creates the Gewirtz graph.
 • The Gewirtz graph is a 22-regular graph with 56 vertices and 280 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{GewirtzGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 56 vertices and 280 edge\left(s\right)}}$ (1)
 > $\mathrm{IsStronglyRegular}\left(G,'\mathrm{parameters}'\right)$
 ${\mathrm{true}}{,}\left[{10}{,}{0}{,}{2}\right]$ (2)
 > $\mathrm{ChromaticNumber}\left(G\right)$
 ${4}$ (3)

References

 "Gewirtz graph", Wikipedia. http://en.wikipedia.org/wiki/Gewirtz_graph

Compatibility

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