A088741 Number of connected strongly regular simple graphs on n nodes.

1, 1, 1, 2, 2, 3, 1, 3, 3, 5

Offset

1,4

Links

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

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

Example

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.

Crossrefs

Cf. A005177, A076435, A294405.

Sequence in context: A369366 A224764 A077268 * A162911 A245327 A352680

Adjacent sequences: A088738 A088739 A088740 * A088742 A088743 A088744

Keyword

nonn,more

Author

Eric W. Weisstein, Oct 12 2003

Extensions

a(10) from the Encyclopedia of Finite Graphs (Travis Hoppe and Anna Petrone), Apr 11 2014

Status

approved