The Picard Group of a finite connected graph is a finite abelian group of order equal to the number of spanning trees of the graph. The Picard Group can be defined in a several different ways, which we consider in this paper. We determine this group for complete bipartite graphs.