Hall Graph

Author

Eric W. Weisstein
October 18, 2018

This notebook downloaded from http://mathworld.wolfram.com/notebooks/GraphTheory/HallGraph.nb.

For more information, see Eric's MathWorld entry http://mathworld.wolfram.com/HallGraph.html.

©2018 Wolfram Research, Inc. except for portions noted otherwise

Construction

distanceregular.org

g=DistanceRegularGraph["http://www.distanceregular.org/graphdata/hall65.am"]

RecognizeGraph[g]

VertexCount[g]

GraphDiameter[g]//Timing

RegularParameters[g]//Timing

DistanceRegularGraphQ[g]//Timing

IntersectionArray[g]//Timing

IntegerSpectrum[g]//SpectrumForm

GroupOrder[GraphAutomorphismGroup[g]]

HamiltonianGraphQ[g]

GraphData

GraphDataString

VertexCount[g]

file=OpenWrite["~/hall.m"]

WriteString[file,GraphDataString[g,
"StandardName"->"HallGraph",
"Name"->"Hall graph",
"Embeddings"->None,
"Information"->"HallGraph",
"Classes"->{"DistanceRegular","DistanceTransitive","LocallyPetersen","Noncirculant","Nongrid"},
Debug->True,
TimeConstraint->10]]

Close[file]