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/HoffmanSingletonGraph

GraphTheory[SpecialGraphs]

  

HoffmanSingletonGraph

  

construct Hoffman-Singleton graph

 

Calling Sequence

Description

Examples

References

Calling Sequence

HoffmanSingletonGraph()

Description

• 

The HoffmanSingletonGraph() command returns the Hoffman-Singleton graph, a 7-regular undirected graph with 50 vertices and 175 edges.

Examples

withGraphTheory:

withSpecialGraphs:

GHoffmanSingletonGraph

GGraph 1: an undirected unweighted graph with 50 vertices and 175 edge(s)

(1)

IsBipartiteG

false

(2)

IsStronglyRegularG,parameters

true,7,0,1

(3)

DrawGraphG

References

  

"Hoffman-Singleton graph", Wikipedia. http://en.wikipedia.org/wiki/Hoffman-Singleton_graph

  

Hoffman, A. J. and Singleton, R. R. "On Moore Graphs of Diameter Two and Three." IBM J. Res. Develop. 4, 497-504, 1960.

See Also

HoffmanGraph

SpecialGraphs