Maximizing Spectral Radius and Number of Spanning Trees in Bipartite Graphs
Maximizing Spectral Radius and Number of Spanning Trees in Bipartite Graphs
The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph. Known results towards the resolution of the conjectures are described. We …