|
%I #16 Nov 02 2017 23:08:08
%S 0,0,1,4,14,59,373,4154,91518,4116896
%N Number of simple connected graphs on n nodes with diameter 2
%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
%H Peter Steinbach, <a href="/A000088/a000088_17.pdf">Field Guide to Simple Graphs, Volume 1</a>, Part 17 [But beware errors] (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphDiameter.html">Graph Diameter</a>
%Y Column k=2 of A294522.
%Y Simple connected graphs of diameter k: A241706, A241707, A241708, A241709, A241710.
%K nonn,hard,more
%O 1,4
%A _Travis Hoppe_ and _Anna Petrone_, Apr 27 2014
|
