Our paper has two goals:
i) We propose the combinatorial approach to facilitate the calculation of the
number of spanning trees for five new classes of graphs.
ii) We use a new powerful operation (subdivision) to get larger graphs from a
given graph.
In particular, we derive the explicit formulas for the subdivision of ladder, fan,
triangular snake, double triangular snake and the total graph of path Pn.