Sciweavers

33 search results - page 2 / 7
» Cliques and the spectral radius
Sort
View
JUCS
2007
99views more  JUCS 2007»
13 years 7 months ago
Spectral Densest Subgraph and Independence Number of a Graph
: 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...
Reid Andersen, Sebastian M. Cioaba
HYBRID
2007
Springer
14 years 1 months ago
Approximation of the Joint Spectral Radius of a Set of Matrices Using Sum of Squares
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...
Pablo A. Parrilo, Ali Jadbabaie
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
13 years 7 months ago
The Spectral Radius of Subgraphs of Regular Graphs
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...
Vladimir Nikiforov