On graphs whose least eigenvalue exceeds - 1 - √2

A.J. Hoffman

doi:10.1016/0024-3795(77)90027-1

Linear Algebra and Its Applications

Paper

01 Jan 1977

On graphs whose least eigenvalue exceeds - 1 - √2

View publication

Abstract

Let G be a graph, A(G) its adjacency matrix. We prove that, if the least eigenvalue of A(G) exceeds -1 - √2 and every vertex of G has large valence, then the least eigenvalue is at least -2 and G is a generalized line graph. © 1997.

Conference paper

On the Convergence of Gradient Descent in GANs: MMD GAN As a Gradient Flow

Conference paper

Super-resolution of Turbulent Flows in the Absence of the High-Resolution Ground Truth

Invited talk

Model Predictive Control for Uncertain Fluid Processing Networks

Conference paper

Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning

View all publications

Abstract

Related

On the Convergence of Gradient Descent in GANs: MMD GAN As a Gradient Flow

Super-resolution of Turbulent Flows in the Absence of the High-Resolution Ground Truth

Model Predictive Control for Uncertain Fluid Processing Networks

Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning