A076435
Number of strongly regular simple graphs on n nodes.
Original entry on oeis.org
1, 2, 2, 4, 3, 6, 2, 6, 5, 8, 2, 10, 3, 6
Offset: 1
1: K_1 (1 graph)
2: \bar K_2, P_2 = K_2 (2 graph)
3: \bar K_3, C_3 = K_3 (2 graphs)
4: \bar K_4, 2P_2, C_4, K_4 (4 graphs)
5: C_5, \bar K_5, K_5 (3 graphs)
6: 2C_3, K_6, \bar K_6, 3P_2, Ci_6(1,2), K_{3,3} (6 graphs)
Here, \bar denotes the graph complement and Ci_n(...) a circular graph.
A294405
Number of connected weakly regular graphs on n nodes.
Original entry on oeis.org
0, 0, 0, 0, 0, 2, 3, 14, 19, 162
Offset: 1
Cf.
A005177 (connected regular graphs).
Cf.
A076434 (not-necessarily connected weakly regular graphs).
Cf.
A088741 (connected strongly regular graphs).
A051427
Number of strictly Deza graphs with n nodes.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 0, 3, 2, 1, 0, 6, 1, 1, 1
Offset: 1
- M. Erickson, S. Fernando, W. H. Haemers, D. Hardy and J. Hemmeter, Deza graphs: A generalization of strongly regular graph, J. Combinatorial Designs, Vol 7, Issue 6, 395-405, Oct 21, 1999. See also here.
- Sean A. Irvine, Java program (github)
A243241
Number of connected simple graphs on n nodes that are not strongly regular.
Original entry on oeis.org
0, 0, 1, 4, 19, 109, 852, 11114, 261077, 11716566
Offset: 1
Showing 1-4 of 4 results.
Comments