2 search results - page 1 / 1 » The Spectral Radius of Subgraphs of Regular Graphs |
COMBINATORICS
2007
13 years 5 months ago
2007
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...
JUCS
2007
13 years 4 months ago
2007
: 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...