  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.
