Short proof for a connected simple graph with fewest spanning trees
Zbigniew R. Bogdanowicz · Applied Mathematical Sciences · 2013
We give a shorter proof than the one currently published in literature that a specific threshold graph on n vertices and m edges has the fewest spanning trees among all connected simple graphs on n vertices and m edges.