Find the number of spanning trees of a dumbbell graph.?
A (k,l) - dumbbell graph is obtained by taking a complete graph on k (labeled) nodes and a complete graph on l (labeled) nodes, and connecting them by a single edge. Find the number of spanning trees of a dumbbell graph.