login
A308601
Number of (not necessarily connected) distance-transitive graphs with n nodes.
0
1, 2, 2, 4, 3, 7, 3, 9, 6, 11, 3, 17, 4
OFFSET
1,2
COMMENTS
All distance-transitive graphs with vertex degree <= 13 are known.
First differs from A286931 (symmetric graphs) at n = 10; the circulant graph Ci_10(1,4) is symmetric but not distance-transitive.
LINKS
Eric Weisstein's World of Mathematics, Distance-Transitive Graph
CROSSREFS
Cf. A286931 (symmetric graphs).
Sequence in context: A101200 A122585 A057449 * A286931 A374405 A336305
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Jun 09 2019
STATUS
approved