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.

Paper

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription

Shashanka Ubaru, Lior Horesh, et al.

Journal of Biomedical Informatics

Conference paper

Characterization of line width variation

Alfred K. Wong, Antoinette F. Molless, et al.

SPIE Advanced Lithography 2000

Paper

Differential operators and the theory of binomial enumeration

George Markowsky

J. Math. Anal. Appl.

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

View all publications

Abstract

Related

Dynamic graph and polynomial chaos based models for contact tracing data analysis and optimal testing prescription

Characterization of line width variation

Differential operators and the theory of binomial enumeration

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