Maximizing the Weighted Number of Spanning Trees: Near-$t$-Optimal Graphs

Kasra Khosoussi, Gaurav S. Sukhatme, Shoudong Huang +1

Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a conn…