  We give a proof for sharp estimate for the number of spanning trees using
linear algebra and generalize this bound to multigraphs. In addition, we show
that this bound is tight for complete graphs. In addition, we give estimates
for number of spanning trees in specific type of graphs such as product of
graphs or Cartesian product of two graphs.
