A088974 Number of (nonisomorphic) connected bipartite graphs with minimum degree at least 2 and with n vertices.

0, 0, 0, 1, 1, 5, 9, 45, 160, 1018, 6956, 67704, 830392, 13539344, 288643968, 8112651795, 300974046019, 14796399706863, 967194378235406, 84374194347669628, 9856131011755992817, 1546820212559671605395

Offset: 1

Author

Felix Goldberg (felixg(AT)tx.technion.ac.il), Oct 30 2003

Keywords

• nonn

Comments

The terms were computed using the program Nauty.

As shown in the Hardt et al. reference, this sequence (for n >= 3) also enumerates the connected point-determining bipartite graphs. - Justin M. Troyka, Nov 27 2013

Examples

			Consider n = 4.  There is one connected bipartite graph with minimum degree at least 2: the square graph.  Also there is one connected point-determining bipartite graph: the graph *--*--*--*. - _Justin M. Troyka_, Nov 27 2013
		

Links

• Brendan McKay, Nauty
• Andy Hardt, Pete McNeely, Tung Phan, and Justin M. Troyka, Combinatorial species and graph enumeration, arXiv:1312.0542 [math.CO].

Crossrefs

Cf. A006024, A004110 (labeled and unlabeled point-determining graphs [the latter is also unlabeled graphs w/ min. degree >= 2]).

Cf. A059167 (labeled graphs w/ min. degree >= 2).

Cf. A092430, A004108 (labeled and unlabeled connected point-determining graphs [the latter is also unlabeled connected graphs w/ min. degree >= 2]).

Cf. A059166 (labeled connected graphs w/ min. degree >= 2).

Cf. A232699, A218090 (labeled and unlabeled point-determining bipartite graphs).

Cf. A232700 (labeled connected point-determining bipartite graphs).

Extensions

More terms from Andy Hardt, Oct 31 2012