|
%I #8 Sep 14 2014 23:48:49
%S 1,1,1,1,1,3,1,3,3,4
%N Number of simple connected graphs with n nodes that are distance regular and K_4 free.
%C K_4 is the complete graph on four vertices.
%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. A241814 (distance regular graphs), A079574 (K_4 free graphs).
%K nonn,more
%O 1,6
%A _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014
|
