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 small subgraphs with large spectral radius. We also prove a Hoffman-type ratio bound for the order of an induced subgraph whose spectral radius is bounded from above. Key Words: graphs, eigenvalues, densest subgraph, independence number Category: F.4.1

• Type: Journal
• Year: 2007
• Where: JUCS
• Authors: Reid Andersen, Sebastian M. Cioaba
• Keywords: Densest Subgraph, Densest Subgraph Problem, JUCS 2007, Spectral Radius