On graphs with the maximum number of spa
β
Alexander K. Kelmans
π
Article
π
1996
π
John Wiley and Sons
π
English
β 814 KB
Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta