Math.Combinatorics.GraphAuts
isVertexTransitive
isEdgeTransitive
(->^)
isArcTransitive
isArcTransitive'
findArcs
isnArcTransitive
is2ArcTransitive
is3ArcTransitive
isDistanceTransitive
refine
refine'
isGraphAut
adjLists
graphAuts1
graphAuts2
graphAuts3
isSingleton
graphAuts4
eqgraph
toEquitable
toEquitable2
splitNumNbrs
graphAuts
graphAutsCon
dfsEquitable
incidenceAuts
incidenceAutsCon
graphIsos
graphIsosCon
isGraphIso
isIso
incidenceIsos
incidenceIsosCon
isIncidenceIso