Number of spanning trees in the join of the disjoint union of two complete graphs each on n vertices with the empty graph on n+1 vertices.
A338104
Number of spanning trees in the join of the disjoint union of two complete graphs each on n vertices with the empty graph on n+1 vertices.
Terms
- a(0) =1a(1) =4a(2) =1200a(3) =2074464a(4) =10883911680
External references
- oeis: A338104