A088741 Number of connected strongly regular simple graphs on n nodes.
1, 1, 1, 2, 2, 3, 1, 3, 3, 5
Offset: 1
Examples
1: K_1 (1 graph)
2: P_2 = K_2 (1 graph)
3: C_3 = K_3 (1 graph)
4: C_4, K_4 (2 graphs)
5: C_5, K_5 (2 graphs)
6: K_6, Ci_6(1,2), K_{3,3} (3 graphs)
Here, Ci_n(...) a circulant graph.
Links
- T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
- T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, Discr. Appl. Math. 201 (2016) 172-181.
- Eric Weisstein's World of Mathematics, Strongly Regular Graph
Extensions
a(10) from the Encyclopedia of Finite Graphs (Travis Hoppe and Anna Petrone), Apr 11 2014