A308601 Number of (not necessarily connected) distance-transitive graphs with n nodes.

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

Table of n, a(n) for n=1..13.

Eric Weisstein's World of Mathematics, Distance-Transitive Graph

Crossrefs

Cf. A286931 (symmetric graphs).

Sequence in context: A101200 A122585 A057449 * A286931 A336305 A265701

Adjacent sequences: A308598 A308599 A308600 * A308602 A308603 A308604

Keyword

nonn,more

Author

Eric W. Weisstein, Jun 09 2019

Status

approved