GraphTheory[SpecialGraphs] - Maple Programming Help

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

GraphTheory[SpecialGraphs]

 FosterGraph
 construct Foster graph

 Calling Sequence FosterGraph()

Description

 • The FosterGraph() command returns the Foster graph, a bipartite 3-regular graph with 90 vertices and 135 edges.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{FosterGraph}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 90 vertices and 135 edge\left(s\right)}}$ (1)
 > $\mathrm{IsBipartite}\left(G\right)$
 ${\mathrm{true}}$ (2)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Foster graph", Wikipedia. http://en.wikipedia.org/wiki/Foster_graph