The solution to the number of spanning trees of the graph below is given by $6$ and $4 \times 4 - 1$ for Graph A and B respectively. I'm not sure how to get this. Please assist. I did ask a similar question a while ago but I'm still not able to figure out for these 2 figures. Thanks!
Graph A :
Graph B :
What I know:
1) Number of spanning trees of a cycle with n vertices is, $\tau(C_n) = n$ 2) I know how to solve the above using the contraction deletion theorem but I'm interested in other methods, thanks!