Let G be a simple connected graph of order n, sequence of vertex degreesi we denote the multiplicative first Zagreb index of graph, andthe Kirchhoff index of G. In this paper we determine several lower and upper bounds for K f depending on some of the graph parameters such as number of vertices, maximum degree, minimum degree, and number of spanning trees or multiplicative Zagreb index.