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

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

Offset: 1

Author

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

Keywords

• hard
• nonn

Comments

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.

Links

• L. E. Danielsen and M. G. Parker, Edge local complementation and equivalence of binary linear codes, Des. Codes Cryptogr., 49 (2008), 161-170.
• L. E. Danielsen, Database of Pivot Orbits.

Crossrefs

A076836