A241707 Number of simple connected graphs on n nodes with diameter 3

0, 0, 0, 1, 5, 43, 387, 5797, 148229, 6959721

Offset

1,5

Links

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

Peter Steinbach, Field Guide to Simple Graphs, Volume 1, Part 17 [But beware errors] (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.)

Eric Weisstein's World of Mathematics, Graph Diameter

Crossrefs

Column k=3 of A294522.

Simple connected graphs of diameter k: A241706, A241707, A241708, A241709, A241710.

Sequence in context: A082311 A269121 A326884 * A322246 A306080 A156886

Adjacent sequences: A241704 A241705 A241706 * A241708 A241709 A241710

Keyword

nonn,hard,more

Author

Travis Hoppe and Anna Petrone, Apr 27 2014

Status

approved