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

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 connectivity measure, emerges in numerous problems and plays a key role in, e.g., network reliability under random edge failure, estimation over networks and D-optimal experimental designs. This paper tackles the open problem of designing graphs with the maximum weighted number of spanning trees under various constraints. We reveal several new structures, such as the log-submodularity of the weighted number of spanning trees in connected graphs. We then exploit these structures and design a pair of efficient approximation algorithms with performance guarantees and near-optimality certificates. Our results can be readily applied to a wide verity of applications involving graph synthesis and graph sparsification scenarios.

[1]  Muriel Médard,et al.  High-reliability topological architectures for networks under stress , 2004, IEEE Journal on Selected Areas in Communications.

[2]  L. Petingia,et al.  A new technique for the characterization of graphs with a maximum number of spanning trees , 2002 .

[3]  Pushmeet Kohli,et al.  Tractability: Practical Approaches to Hard Problems , 2013 .

[4]  Alexander K. Kelmans.  On graphs with the maximum number of spanning trees , 1996, Random Struct. Algorithms.

[5]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[6]  J. Oxley.  Matroid Theory (Oxford Graduate Texts in Mathematics) , 2006 .

[7]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[8]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  D. R. Shier,et al.  Maximizing the number of spanning trees in a graph with n nodes and m edges , 1974 .

[11]  Stephen P. Boyd,et al.  Graph Implementations for Nonsmooth Convex Programs , 2008, Recent Advances in Learning and Control.

[12]  Ching-Shui Cheng,et al.  Maximizing the total number of spanning trees in a graph: Two related problems in graph theory and optimum design theory , 1981, J. Comb. Theory B.

[13]  R. V. Slyke,et al.  On the validity of a reduction of reliable network design to a graph extremal problem , 1987 .

[14]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[15]  Stephen P. Boyd,et al.  Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[16]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[17]  James G. Oxley,et al.  Matroid theory , 1992 .

[18]  Carl D. Meyer,et al.  Matrix Analysis and Applied Linear Algebra , 2000 .

[19]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[20]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[21]  Alexander K. Kelmans,et al.  Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications , 1983, Discret. Math..

[22]  Appajosyula Satyanarayana,et al.  A survey of some network reliability analysis and synthesis results , 2009, Networks.

[23]  Kim-Chuan Toh,et al.  Solving semidefinite-quadratic-linear programs using SDPT3 , 2003, Math. Program..

[24]  Laurence A. Wolsey,et al.  An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..

[25]  Michael Jackson,et al.  Optimal Design of Experiments , 1994 .

[26]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[27]  J. Hespanha,et al.  Estimation on graphs from relative measurements , 2007, IEEE Control Systems.

[28]  Andreas Krause,et al.  Submodular Function Maximization , 2014, Tractability.

[29]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[30]  Peter J. Cameron,et al.  Combinatorics of optimal designs , 2008 .

[31]  N. Gaffke,et al.  D-optimal block designs with at most six varieties , 1982 .

[32]  José Rodríguez,et al.  A new technique for the characterization of graphs with a maximum number of spanning trees , 2002, Discret. Math..

[33]  Wendy Myrvold.  Reliable Network Synthesis: Some Recent Developments , 1996 .