A327363 Triangle read by rows where T(n,k) is the number of labeled simple graphs with n vertices and vertex-connectivity >= k.

1, 1, 0, 2, 1, 0, 8, 4, 1, 0, 64, 38, 10, 1, 0, 1024, 728, 238, 26, 1, 0

Offset

0,4

Comments

The vertex-connectivity of a graph is the minimum number of vertices that must be removed (along with any incident edges) to obtain a non-connected graph or singleton.

Links

Table of n, a(n) for n=0..20.

Example

Triangle begins:
     1
     1    0
     2    1    0
     8    4    1    0
    64   38   10    1    0
  1024  728  238   26    1    0

Mathematica

vertConnSys[vts_, eds_]:=Min@@Length/@Select[Subsets[vts], Function[del, Length[del]==Length[vts]-1||csm[DeleteCases[DeleteCases[eds, Alternatives@@del, {2}], {}]]!={Complement[vts, del]}]];
Table[Length[Select[Subsets[Subsets[Range[n], {2}]], vertConnSys[Range[n], #]>=k&]], {n, 0, 4}, {k, 0, n}]

Crossrefs

Column k = 0 is A006125.

Column k = 1 is A001187.

Column k = 2 is A013922.

The unlabeled version is A327805.

Row-wise partial sums of A327334 (vertex-connectivity exactly k).

Cf. A259862, A327114, A327125, A327126, A327127, A327806.

Sequence in context: A076341 A110510 A337506 * A051122 A380368 A307656

Adjacent sequences: A327360 A327361 A327362 * A327364 A327365 A327366

Keyword

nonn,tabl,more

Author

Gus Wiseman, Sep 26 2019

Status

approved