A389388 Number of not necessarily connected bridgeless spanning subgraphs of the cocktail party graph of order n.

1, 2, 958, 8326908

Offset

1,2

Comments

For a polyhedral graph, the number of bridgeless spanning subgraphs is equal to the number of partitions of the vertices of its dual graph into connected subsets. In particular, a(3) = A058975(3).

Links

Table of n, a(n) for n=1..4.

Eric Weisstein's World of Mathematics, Bridgeless Graph.

Eric Weisstein's World of Mathematics, Cocktail Party Graph.

Eric Weisstein's World of Mathematics, Polyhedral Graph.

Crossrefs

Cf. A058975, A389387, A389389.

Sequence in context: A332192 A258586 A176940 * A337309 A172386 A079233

Adjacent sequences: A389385 A389386 A389387 * A389389 A389390 A389391

Keyword

nonn,more

Author

Pontus von Brömssen, Oct 07 2025

Status

approved