As is known, the number of spanning tress of a regular graph can be determined by the graph spectrum. In this paper we describe a new variant of the spectral method for determining the number of spanning trees, which enables to solve the problem for a class of non-regular graphs.