Number of spanning trees in the join of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.
A338527
Number of spanning trees in the join of the disjoint union of two complete graphs each on n and n+1 vertices with the empty graph on n+1 vertices.
Terms
- a(0) =24a(1) =13500a(2) =34420736a(3) =239148450000
External references
- oeis: A338527