The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327146 Number of labeled simple graphs with n vertices and spanning edge-connectivity 2. 12
 0, 0, 0, 1, 9, 227 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS The spanning edge-connectivity of a graph is the minimum number of edges that must be removed (without removing incident vertices) to obtain a disconnected or empty graph. LINKS MATHEMATICA csm[s_]:=With[{c=Select[Tuples[Range[Length[s]], 2], And[OrderedQ[#], UnsameQ@@#, Length[Intersection@@s[[#]]]>0]&]}, If[c=={}, s, csm[Sort[Append[Delete[s, List/@c[[1]]], Union@@s[[c[[1]]]]]]]]]; spanEdgeConn[vts_, eds_]:=Length[eds]-Max@@Length/@Select[Subsets[eds], Union@@#!=vts||Length[csm[#]]!=1&]; Table[Length[Select[Subsets[Subsets[Range[n], {2}]], spanEdgeConn[Range[n], #]==2&]], {n, 0, 4}] CROSSREFS Column k = 2 of A327069. BII-numbers of set-systems with spanning edge-connectivity 2 are A327108. The generalization to set-systems is A327130. Cf. A006129, A327070, A327071, A327102, A327109, A327111, A327129, A327144. Sequence in context: A218536 A338377 A211048 * A158728 A197406 A197428 Adjacent sequences:  A327143 A327144 A327145 * A327147 A327148 A327149 KEYWORD nonn,more AUTHOR Gus Wiseman, Aug 27 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 21 12:36 EDT 2021. Contains 343150 sequences. (Running on oeis4.)