Abstract
In mathematics, one always tries to get new structures from given ones. This also applies to the realm of graphs, where one can generate many new graphs from a given set of graphs. In this paper we derive the explicit formulas of the number of spanning trees of some graphs generated from the ladder graph.