Ivanov-Ivanov-Faradjev Graph

Author

Eric W. Weisstein
October 17, 2018

This notebook downloaded from http://mathworld.wolfram.com/notebooks/GraphTheory/Ivanov-Ivanov-FaradjevGraph.nb.

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

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

Construction

distanceregular.org

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

ToEntity[g]

VertexCount[g]

GraphDiameter[g]//Timing

RegularParameters[g]//Timing

DistanceRegularGraphQ[g]//Timing

IntersectionArray[g]//Timing

Tally[Sort@Round[10^5Eigenvalues[N@AdjacencyMatrix[g]]]1.*^-5]//Timing

(#(Sqrt[33])- 1)/2.&/@{-1,1}

IntegerSpectrum[g]

GroupOrder[GraphAutomorphismGroup[g]]

HamiltonianGraphQ[g]

SemisymmetricGraphQ[g]

GraphData

GraphDataString

VertexCount[g]

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

WriteString[file,GraphDataString[g,
"StandardName"->"IvanovIvanovFaradjevGraph",
"Name"->"Ivanov\[Hyphen]Ivanov\[Hyphen]Faradjev graph",
"Embeddings"->None,
"Information"->None,
"Classes"->{"DistanceRegular","DistanceTransitive","Noncirculant","Nongrid"},
Debug->True,
TimeConstraint->10]]

Close[file]