GraphTheory[SpecialGraphs] - Maple Programming Help

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

GraphTheory[SpecialGraphs]

 DesarguesGraph
 construct Desargues graph

 Calling Sequence DesarguesGraph()

Description

 • The DesarguesGraph() command returns the Desargues graph, a distance-transitive cubic graph with 20 vertices and 30 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{DesarguesGraph}\left(\right)$
 ${G}{:=}{\mathrm{Graph 1: an undirected unweighted graph with 20 vertices and 30 edge\left(s\right)}}$ (1)
 > $\mathrm{IsPlanar}\left(G\right)$
 ${\mathrm{false}}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Desargues graph", Wikipedia. http://en.wikipedia.org/wiki/Desargues_graph