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

Generative Adversarial Symmetry Discovery

Jianke Yang, Robin Walters, et al.

ICML 2023

Conference paper

Effects of KrF laser radiation on fused-silica glass: a comparison of samples exposed in air vs vacuum

I.K. Pour, D.J. Krajnovich, et al.

SPIE Optical Materials for High Average Power Lasers 1992

Paper

Conditional generative models for learning stochastic processes

Salvatore Certo, Anh Pham, et al.

Quantum Machine Intelligence

Conference paper

QoS support for media broadcast in a services oriented architecture

D.S. Turaga, K. Ratakonda, et al.

SCC 2006

View all publications

Abstract

Related

Generative Adversarial Symmetry Discovery

Effects of KrF laser radiation on fused-silica glass: a comparison of samples exposed in air vs vacuum

Conditional generative models for learning stochastic processes

QoS support for media broadcast in a services oriented architecture