

A088741


Number of connected strongly regular simple graphs on n nodes.


4




OFFSET

1,4


LINKS



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



KEYWORD

nonn,more


AUTHOR



EXTENSIONS



STATUS

approved



