id:A156802 - OEIS Search Results

Search: id:A156802

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 1, 1, 2, 3, 8, 15, 43, 110, 370, 1260, 5366, 25684, 154104, 1156716 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`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` `Sequence in context: A148002 A148003 A148004 this_sequence A148005 A151394 A148006` `Adjacent sequences: A156799 A156800 A156801 this_sequence A156803 A156804 A156805`
	KEYWORD	`hard,nonn`
	AUTHOR	`Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.