|
Short proof for a connected simple graph with fewest spanning treesKeywords: spanning tree , enumeration of trees , simple graph , extremal graph Abstract: 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.
|