A156802 - OEIS

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

%S 1,1,1,2,3,8,15,43,110,370,1260,5366,25684,154104,1156716

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

%C Also equal to the number of inequivalent indecomposable binary linear codes of length n plus the number of inequivalent indecomposable isodual binary linear codes of length n, divided by two.

%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>.

%Y A076836

%K hard,nonn

%O 1,4

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