login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241814 Number of distance-regular simple connected graphs on n nodes. 10
1, 1, 1, 2, 2, 4, 2, 5, 4, 7 (list; graph; refs; listen; history; text; internal format)
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
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, Distance-Regular Graph
CROSSREFS
Sequence in context: A232245 A121895 A139555 * A088371 A133181 A286280
KEYWORD
nonn,hard,more
AUTHOR
Travis Hoppe and Anna Petrone, Apr 29 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)