login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of equivalence classes of connected graphs on n nodes up to sequences of edge local complementation and isomorphism.
0

%I #1 Feb 27 2009 03:00:00

%S 1,1,2,4,10,35,134,777,6702,104825,3370317,231557290

%N Number of equivalence classes of connected graphs on n nodes up to sequences of edge local complementation and isomorphism.

%H L. E. Danielsen and M. G. Parker, <a href="http://arxiv.org/abs/0710.2243">Edge local complementation and equivalence of binary linear codes</a>, Des. Codes Cryptogr., 49 (2008), 161-170.

%H L. E. Danielsen, <a href="http://www.ii.uib.no/~larsed/pivot/">Database of Pivot Orbits</a>.

%K hard,nonn

%O 1,3

%A Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009