cp's OEIS Frontend

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

%I A088974 #15 Mar 18 2017 16:13:46
%S A088974 0,0,0,1,1,5,9,45,160,1018,6956,67704,830392,13539344,288643968,
%T A088974 8112651795,300974046019,14796399706863,967194378235406,
%U A088974 84374194347669628,9856131011755992817,1546820212559671605395
%N A088974 Number of (nonisomorphic) connected bipartite graphs with minimum degree at least 2 and with n vertices.
%C A088974 The terms were computed using the program Nauty.
%C A088974 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
%H A088974 Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/nauty/">Nauty</a>
%H A088974 Andy Hardt, Pete McNeely, Tung Phan, and Justin M. Troyka, <a href="http://arxiv.org/abs/1312.0542">Combinatorial species and graph enumeration</a>, arXiv:1312.0542 [math.CO].
%e A088974 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
%Y A088974 Cf. A006024, A004110 (labeled and unlabeled point-determining graphs [the latter is also unlabeled graphs w/ min. degree >= 2]).
%Y A088974 Cf. A059167 (labeled graphs w/ min. degree >= 2).
%Y A088974 Cf. A092430, A004108 (labeled and unlabeled connected point-determining graphs [the latter is also unlabeled connected graphs w/ min. degree >= 2]).
%Y A088974 Cf. A059166 (labeled connected graphs w/ min. degree >= 2).
%Y A088974 Cf. A232699, A218090 (labeled and unlabeled point-determining bipartite graphs).
%Y A088974 Cf. A232700 (labeled connected point-determining bipartite graphs).
%K A088974 nonn
%O A088974 1,6
%A A088974 Felix Goldberg (felixg(AT)tx.technion.ac.il), Oct 30 2003
%E A088974 More terms from _Andy Hardt_, Oct 31 2012