A327336 Number of labeled simple graphs with vertex-connectivity 1.
0, 0, 1, 3, 28, 490, 15336, 851368, 85010976, 15615858960, 5388679220480, 3548130389657216, 4507988483733389568, 11145255551131555572992, 53964198507018134569758720, 514158235191699333805861463040, 9672967865350359173180572164444160
Offset: 0
Keywords
Examples
The a(2) = 1 through a(4) = 28 edge-sets: {12} {12,13} {12,13,14} {12,23} {12,13,24} {13,23} {12,13,34} {12,14,23} {12,14,34} {12,23,24} {12,23,34} {12,24,34} {13,14,23} {13,14,24} {13,23,24} {13,23,34} {13,24,34} {14,23,24} {14,23,34} {14,24,34} {12,13,14,23} {12,13,14,24} {12,13,14,34} {12,13,23,24} {12,13,23,34} {12,14,23,24} {12,14,24,34} {12,23,24,34} {13,14,23,34} {13,14,24,34} {13,23,24,34} {14,23,24,34}
Links
- Andrew Howroyd, Table of n, a(n) for n = 0..50
Crossrefs
Programs
-
Mathematica
csm[s_]:=With[{c=Select[Subsets[Range[Length[s]],{2}],Length[Intersection@@s[[#]]]>0&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]]; 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],#]==1&]],{n,0,4}]
Extensions
Terms a(6) and beyond from Andrew Howroyd, Sep 11 2019
Comments