SpanningSubgraphCount
The subgraphs on all the vertices: 2 to the power of the number of edges.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000343via LabeledGraph✓SpanningSubgraphCount(graph)The subgraphs on all the vertices: 2 to the power of the number of edges.Typed signatures
| Type | Package | Applies |
|---|---|---|
(labeled_graph) -> number | combinatorics | always |
Details
- Defined over
LabeledGraphas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
LabeledGraphand nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer. - FindStat's St000343, the Tutte polynomial at x = y = 2. The graph with no vertices has one, so 1.
Definition
Epsil, as the implementation runs it.
on LabeledGraph, over _x
1 if _x[1] == 0 else Apply((n: integer) => Apply(
(edges: list<list<integer>>) => 2 ^ Length(edges),
_x[2],
), _x[1])Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |