: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach i...
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite di...