%0 Journal Article
%T Short proof for a connected simple graph with fewest spanning trees
%A Z. R. Bogdanowicz
%J Applied Mathematical Sciences
%D 2013
%I 
%X We give a shorter proof than the one currently published in literaturethat a specific threshold graph on n vertices and m edges has the fewestspanning trees among all connected simple graphs on n vertices and medges.
%K spanning tree
%K enumeration of trees
%K simple graph
%K extremal graph
%U http://www.m-hikari.com/ams/ams-2013/ams-29-32-2013/bogdanowiczAMS29-32-2013.pdf