|
%I #9 Sep 14 2014 23:38:29
%S 1,1,0,1,0,2,0,3,0,3
%N Number of simple connected graphs with n nodes that are bipartite and distance regular.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014
%Y Cf. A003216 (bipartite graphs), A241814 (distance regular graphs).
%K nonn,more
%O 1,6
%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014
|
