|
|
A241814
|
|
Number of distance-regular simple connected graphs on n nodes.
|
|
10
|
|
|
|
OFFSET
|
1,4
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|