In this article, we study the number of spanning trees of double graphs (direct product of a simple graph) and obtain some upper bounds for double graphs, especially for double tree graphs, double unicyclic graphs and double bicyclic graphs. The extremal graphs are also determined.