GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


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

GraphTheory[SpecialGraphs]

  

HarborthGraph

  

construct Harborth graph

 

Calling Sequence

Description

Examples

References

Compatibility

Calling Sequence

HarborthGraph()

Description

• 

The HarborthGraph() command constructs the Harborth graph.

• 

The Harborth graph is a 4-regular graph with 52 vertices and 104 edges, named after H. Harborth. It is the smallest known 4-regular matchstick graph.

Examples

withGraphTheory:

withSpecialGraphs:

HHarborthGraph

HGraph 1: an undirected unweighted graph with 52 vertices and 104 edge(s)

(1)

IsPlanarH

true

(2)

IsRegularH

true

(3)

ChromaticNumberH

3

(4)

DrawPlanarH

References

  

"Matchstick graph", Wikipedia. http://en.wikipedia.org/wiki/Matchstick_graph

Compatibility

• 

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

• 

For more information on Maple 2020 changes, see Updates in Maple 2020.

See Also

SpecialGraphs