

A241814


Number of distanceregular simple connected graphs on n nodes.


10




OFFSET

1,4


COMMENTS

Since the smallest distanceregular graph that is not distancetransitive is the Shrikhande graph with 16 vertices (Brouwer et al. 1989, p. 136), this counts distance transitive graphs up to and including a(15).


LINKS

Table of n, a(n) for n=1..10.
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014
Eric Weisstein's World of Mathematics, DistanceRegular Graph


CROSSREFS

Sequence in context: A232245 A121895 A139555 * A088371 A133181 A286280
Adjacent sequences: A241811 A241812 A241813 * A241815 A241816 A241817


KEYWORD

nonn,hard,more


AUTHOR

Travis Hoppe and Anna Petrone, Apr 29 2014


STATUS

approved



