Tables

with graph isomorphism:

Number of bipartite pivot-inequivalent connected graphs (i_n) and possibly unconnected graphs (t_n):

	1	2	3	4	5	6	7	8	9	10	11	12	13
in	1	1	1	2	3	8	15	43	110	370	1260	5366	25684
tn	1	2	3	6	10	22	43	104	250	720	2229	8361	36441

without graph isomorphism:

Number of bipartite pivot-inequivalent connected graphs (i_n) and possibly unconnected graphs (t_n):

	1	2	3	4	5	6	7
in	1	1	1	4	26	251	3412
tn	1	2	5	18	92	693	7613

File formats

The ANF files contains Boolean functions in algebraic normal form notation. Example: "03,13,23," is the function "x₀x₃+x₁x₃+x₂x₃", which can also be interpreted as the graph with undirected edges {(0,3),(1,3),(2,3)}.

Files

with graph isomorphism:

More Detailed Files

with graph isomorphism:

Files

without graph isomorphism:

More Detailed Files

without graph isomorphism: