A241814 Number of distance-regular simple connected graphs on n nodes.

1, 1, 1, 2, 2, 4, 2, 5, 4, 7

Offset: 1

Author

Travis Hoppe and Anna Petrone, Apr 29 2014

Keywords

• nonn
• hard
• more

Comments

Since the smallest distance-regular graph that is not distance-transitive 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

• Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
• Travis Hoppe and Anna Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
• Eric Weisstein's World of Mathematics, Distance-Regular Graph