|
%I #12 Jun 27 2014 15:03:12
%S 1,1,1,1,1,2,1,3,2,4
%N Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to diamond graph.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%Y Cf. A242790 (diamond free graphs), A241814 (distance regular graphs).
%K nonn,more
%O 1,6
%A _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014
|
