How many spanning trees does the wheel graph WnW_nWn (central vertex + Cn−1C_{n-1}Cn−1) have?
L2(n−1)−2L_{2(n-1)} - 2L2(n−1)−2
F2(n−1)F_{2(n-1)}F2(n−1)
Depends on nnn parity.
2n−2−12^{n-2} - 12n−2−1