A241706
Number of simple connected graphs on n nodes with diameter 2.
Original entry on oeis.org
0, 0, 1, 4, 14, 59, 373, 4154, 91518, 4116896
Offset: 1
- Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
- Travis Hoppe and Anna Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 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
A241707
Number of simple connected graphs on n nodes with diameter 3.
Original entry on oeis.org
0, 0, 0, 1, 5, 43, 387, 5797, 148229, 6959721
Offset: 1
- Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
- Travis Hoppe and Anna Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 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
A241708
Number of simple connected graphs on n nodes with diameter 4.
Original entry on oeis.org
0, 0, 0, 0, 1, 8, 82, 1027, 19320, 598913
Offset: 1
A241709
Number of simple connected graphs on n nodes with diameter 5.
Original entry on oeis.org
0, 0, 0, 0, 0, 1, 9, 125, 1818, 37856
Offset: 1
A241710
Number of simple connected graphs on n nodes with diameter 6.
Original entry on oeis.org
0, 0, 0, 0, 0, 0, 1, 12, 180, 2928
Offset: 1
A324244
Triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with k peripheral nodes.
Original entry on oeis.org
1, 0, 1, 0, 1, 1, 0, 2, 2, 2, 0, 5, 4, 7, 5, 0, 25, 20, 16, 23, 28, 0, 185, 146, 119, 57, 123, 223, 0, 2459, 1728, 1523, 948, 405, 903, 3151, 0, 58156, 36109, 32119, 24637, 13927, 4713, 11746, 79673, 0, 2617378, 1446609, 1304109, 1026845, 723871, 353620, 110734, 279535, 3853870
Offset: 1
Triangle begins:
1;
0, 1;
0, 1, 1;
0, 2, 2, 2;
0, 5, 4, 7, 5;
0, 25, 20, 16, 23, 28;
0, 185, 146, 119, 57, 123, 223;
0, 2459, 1728, 1523, 948, 405, 903, 3151;
0, 58156, 36109, 32119, 24637, 13927, 4713, 11746, 79673;
...
A324239
Irregular triangle read by rows: T(n,k) is the number of simple connected graphs on n nodes with radius k, (0 <= k <= floor(n/2)).
Original entry on oeis.org
1, 0, 1, 0, 2, 0, 4, 2, 0, 11, 10, 0, 34, 76, 2, 0, 156, 682, 15, 0, 1044, 9864, 207, 2, 0, 12346, 245518, 3197, 19, 0, 274668, 11366961, 74614, 326, 2
Offset: 1
Triangle begins:
1;
0, 1;
0, 2;
0, 4, 2;
0, 11, 10;
0, 34, 76, 2;
0, 156, 682, 15;
0, 1044, 9864, 207, 2;
0, 12346, 245518, 3197, 19;
0, 274668, 11366961, 74614, 326, 2;
...
Showing 1-7 of 7 results.
Comments