GraphTheory[SpecialGraphs] - Maple Programming Help

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

GraphTheory[SpecialGraphs]

 SzekeresSnark
 construct Szekeres snark graph
 DoubleStarSnark
 construct double snark graph

 Calling Sequence SzekeresSnark() DoubleStarSnark()

Description

 • A snark is a nontrivial cubic graph with chromatic index 4.
 • The SzekeresSnark command creates a snark with 50 vertices.
 • The DoubleStarSnark command creates a snark with 30 vertices.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$
 > $\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{SzekeresSnark}\left(\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 50 vertices and 75 edge\left(s\right)}}$ (1)
 > $\mathrm{DrawGraph}\left(G\right)$
 > $H≔\mathrm{DoubleStarSnark}\left(\right)$
 ${H}{≔}{\mathrm{Graph 2: an undirected unweighted graph with 30 vertices and 45 edge\left(s\right)}}$ (2)
 > $\mathrm{DrawGraph}\left(H\right)$