A339071 -id:A339071 - cp's OEIS frontend

A002218 Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n nodes.

0, 1, 1, 3, 10, 56, 468, 7123, 194066, 9743542, 900969091, 153620333545, 48432939150704, 28361824488394169, 30995890806033380784, 63501635429109597504951, 244852079292073376010411280, 1783160594069429925952824734641, 24603887051350945867492816663958981

Offset: 1

N. J. A. Sloane

By definition, a(n) gives the number of graphs with zero cutpoints. - Travis Hoppe, Apr 28 2014
For n > 2, a(n) is also the number of simple biconnected graphs on n nodes. - Eric W. Weisstein, Dec 07 2021
This sequence follows R. W. Robinson's definition of a nonseparable graph which includes K_2 but not the singleton graph K_1. This definition is most suited to graphical enumeration. Other authors sometimes include K_1 as a block or exclude K_2 as not 2-connected. - Andrew Howroyd, Feb 26 2023

P. Butler and R. W. Robinson, On the computer calculation of the number of nonseparable graphs, pp. 191 - 208 of Proc. Second Caribbean Conference Combinatorics and Computing (Bridgetown, 1977). Ed. R. C. Read and C. C. Cadogan. University of the West Indies, Cave Hill Campus, Barbados, 1977. vii+223 pp.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 188.
R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1978.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 1..40 [terms 1..26 from R. W. Robinson]
P. Butler and R. W. Robinson, On the computer calculation of the number of nonseparable graphs, pp. 191 - 208 of Proc. Second Caribbean Conference Combinatorics and Computing (Bridgetown, 1977). Ed. R. C. Read and C. C. Cadogan. University of the West Indies, Cave Hill Campus, Barbados, 1977. vii+223 pp. [Annotated scanned copy]
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018.
R. W. Robinson, Computer print-out of first 26 terms [Annotated scanned copy]
R. W. Robinson, Tables
R. W. Robinson, Tables [Local copy, with permission]
R. W. Robinson, Enumeration of non-separable graphs, J. Combin. Theory 9 (1970), 327-356.
R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289-308.
R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289-308.
Andrés Santos, Density Expansion of the Equation of State, in A Concise Course on the Theory of Classical Liquids, Volume 923 of the series Lecture Notes in Physics, pp 33-96, 2016. DOI:10.1007/978-3-319-29668-5_3. See Reference 40.
Andrew J. Schultz and David A. Kofke, Fifth to eleventh virial coefficients of hard spheres, Phys. Rev. E 90, 023301, 4 August 2014
D. Stolee, Isomorph-free generation of 2-connected graphs with applications, arXiv preprint arXiv:1104.5261 [math.CO], 2011.
Rodrigo Stange Tessinari, Marcia Helena Moreira Paiva, Maxwell E. Monteiro, Marcelo E. V. Segatto, Anilton Garcia, George T. Kanellos, Reza Nejabati, and Dimitra Simeonidou, On the Impact of the Physical Topology on the Optical Network Performance, IEEE British and Irish Conference on Optics and Photonics (BICOP 2018), London.
Eric Weisstein's World of Mathematics, Biconnected Graph
Eric Weisstein's World of Mathematics, k-Connected Graph

Column k=0 of A325111 (for n>1).
Column sums of A339070.
Row sums of A339071.
The labeled version is A013922.
Cf. A000088 (graphs), A001349 (connected graphs), A006289, A006290, A004115 (rooted case), A010355 (by edges), A241767.

\\ See A004115 for graphsSeries and A339645 for combinatorial species functions.
cycleIndexSeries(n)={my(g=graphsSeries(n), gc=sLog(g), gcr=sPoint(gc)); intformal(x*sSolve( sLog( gcr/(x*sv(1)) ), gcr ), sv(1)) + sSolve(subst(gc, sv(1), 0), gcr)}
{ my(N=12); Vec(OgfSeries(cycleIndexSeries(N)), -N) } \\ Andrew Howroyd, Dec 28 2020

More terms from Ronald C. Read. Robinson and Walsh list the first 26 terms.
a(1) changed from 0 to 1 by Eric W. Weisstein, Dec 07 2021
a(1) restored to 0 by Andrew Howroyd, Feb 26 2023

A010355 Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n edges.

Original entry on oeis.org

1, 0, 1, 1, 2, 4, 7, 16, 42, 111, 331, 1094, 3829, 14380, 57069, 237188, 1027929, 4622588, 21494274, 103077677, 508743475, 2579847563, 13422868110, 71570635306, 390670937143

Offset: 1

N. J. A. Sloane

Original name: Single-edge stars with n edges.

			From _Andrew Howroyd_, Nov 23 2020: (Start)
The a(1) = 1 graph is the single edge (K_2 = P_2).
The a(3) = 1 graph is the triangle (K_3).
The a(4) = 1 graph is the square (C_4).
The a(5) = 2 graphs are the cycle C_5 and a cycle of 4 nodes with one diagonal added.
(End)

George A. Baker Jr. and John M. Kincaid, The continuous-spin Ising model, g0:phi4:d field theory and the renormalization group. J. Statist. Phys. 24 (1981), no. 3, 469-528.
Brendan McKay and Adolfo Piperno, Practical Graph Isomorphism, II, Journal of Symbolic Computation, 60 (2014), pp. 94-112.
Brendan McKay and Adolfo Piperno, nauty and Traces, programs for computing automorphism groups of graphs and digraphs.
R. W. Robinson, Tables of 2-Connected and 3-Connected Graphs by Nodes and Edges, Table IV, pages 4-9.
M. F. Sykes, D. S. McKenzie, and B. R. Heap, Specific heat of a three-dimensional Ising ferromagnet above the Curie temperature. III. The star cluster expansion, J. Phys. A: Math. Nucl. Gen., 7 (1974), 1576.

Row sums of A339070 and A010356.
Column sums of A339071.
Cf. A002218, A010357, A322139, A338511.

a(11)-a(12) from Andrey Zabolotskiy, Oct 03 2017
Name changed by Andrew Howroyd, Nov 23 2020
a(13)-a(18) added using data from Robinson's tables by Andrew Howroyd, Nov 23 2020
a(19)-a(22) from Hugo Pfoertner using program geng from nauty, Dec 04 2020
a(23)-a(24) from Hugo Pfoertner, Dec 07 2020
a(25) from Hugo Pfoertner, Jan 04 2021

A339070 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) graphs with n edges and k nodes (n >= 1, 2 <= k <= n + 1).

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 0, 3, 3, 1, 0, 0, 0, 0, 2, 9, 4, 1, 0, 0, 0, 0, 1, 14, 20, 6, 1, 0, 0, 0, 0, 1, 12, 50, 40, 7, 1, 0, 0, 0, 0, 0, 8, 82, 161, 70, 9, 1, 0, 0, 0, 0, 0, 5, 94, 429, 433, 121, 11, 1, 0, 0, 0, 0, 0, 2, 81, 780, 1729, 1034, 189, 13, 1, 0

Offset: 1

Andrew Howroyd, Nov 23 2020

			Triangle T(n,k) begins (n edges >= 1, k vertices >= 2):
  1;
  0, 0;
  0, 1, 0;
  0, 0, 1, 0;
  0, 0, 1, 1,  0;
  0, 0, 1, 2,  1,  0;
  0, 0, 0, 3,  3,  1,   0;
  0, 0, 0, 2,  9,  4,   1,   0;
  0, 0, 0, 1, 14, 20,   6,   1,   0;
  0, 0, 0, 1, 12, 50,  40,   7,   1,  0;
  0, 0, 0, 0,  8, 82, 161,  70,   9,  1, 0;
  0, 0, 0, 0,  5, 94, 429, 433, 121, 11, 1, 0;
  ...

Hugo Pfoertner, Table of n, a(n) for n = 1..325 (rows 1..25, first 18 rows extracted from Robinson's tables, rows 19-20 from Andrew Howroyd)
R. W. Robinson, Tables of 2-Connected and 3-Connected Graphs by Nodes and Edges, Table IV, pages 4-9.

Row sums are A010355.
Column sums are A002218.
Cf. A054923, A123534, A253186, A339071 (transpose), A339160.

T(n, n) = 1 for n >= 3.

T(n, n-1) = A253186(n-3) for n >= 3.

First row and column removed by Andrew Howroyd, Dec 05 2020

A339072 Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).

Original entry on oeis.org

1, 1, 1, 1, 2, 3, 4, 4, 2, 1, 1, 3, 14, 25, 31, 28, 17, 9, 5, 2, 1, 1, 4, 24, 101, 254, 413, 475, 426, 306, 187, 103, 52, 23, 11, 5, 2, 1, 1, 19, 204, 1068, 3348, 7152, 11199, 13683, 13604, 11374, 8203, 5216, 2963, 1536, 737, 333, 144, 62, 25, 11, 5, 2, 1, 1

Offset: 4

Andrew Howroyd, Nov 24 2020

			Triangle begins:
===========================================================
n/k | 6  7  8   9  10 11  12  13  14  15  16 17 18 19 20 21
----+------------------------------------------------------
  4 | 1;
  5 |       1,  1,  1;
  6 |           2,  3, 4,  4,  2,  1,  1;
  7 |                  3, 14, 25, 31, 28, 17, 9, 5, 2, 1, 1;
  8 |                      4, 24 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 4..732 (rows n=4..18, extracted from Robinson's tables)
R. W. Robinson, Tables of 2-Connected and 3-Connected Graphs by Nodes and Edges, Table VI, pages 19-27.

Row sums are A006290.
Column sums are A338511.
Cf. A054924, A123542, A339071.

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 5, 4, 2, 1, 1, 4, 17, 30, 34, 29, 17, 9, 5, 2, 1, 1, 5, 33, 133, 307, 464, 505, 438, 310, 188, 103, 52, 23, 11, 5, 2, 1, 1, 25, 277, 1352, 3953, 7939, 11897, 14131, 13827, 11465, 8235, 5226, 2966, 1537, 737, 333, 144, 62, 25, 11, 5, 2, 1, 1

Offset: 4

Andrew Howroyd, Nov 24 2020

			Triangle begins:
===========================================================
n/k | 6  7  8   9  10 11  12  13  14  15  16 17 18 19 20 21
----+------------------------------------------------------
  4 | 1;
  5 |       1,  1,  1;
  6 |           2,  4, 5,  4,  2,  1,  1;
  7 |                  4, 17, 30, 34, 29, 17, 9, 5, 2, 1, 1;
  8 |                      5, 33 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 4..732 (rows n=4..18, extracted from Robinson's tables)
R. W. Robinson, Tables of 2-Connected and 3-Connected Graphs by Nodes and Edges, Table V, pages 10-18.
R. W. Robinson and T. R. S. Walsh, Inversion of cycle index sum relations for 2- and 3-connected graphs, J. Combin. Theory Ser. B. 57 (1993), 289-308.

Row sums are A006289.
Column sums are A339068.
Cf. A123545, A123546, A339071, A339072.

cp's OEIS Frontend

A002218 Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n nodes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

PARI

Extensions

A010355 Number of unlabeled nonseparable (or 2-connected) graphs (or blocks) with n edges.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A339070 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) graphs with n edges and k nodes (n >= 1, 2 <= k <= n + 1).

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

Extensions

A339072 Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).

Views

Author

Keywords

Examples

Links

Crossrefs

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).

Views

Author

Keywords

Examples

Links

Crossrefs

A339072 Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).

A339069 Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3n/2) <= k <= n(n-1)/2).