Trace-minimal graphs maximizing the number of spanning trees
A classical problem in spectral graph theory is to determine, among all simple graphs with a fixed number of vertices and edges, those that maximize the number of spanning trees. Such graphs are called $t$-optimal. Petingi and Rodr\'iguez [Discr. Math. 244 (2002), 351-373] reduced the construction of infinitely many $t...