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

Multi-dimensional Filter Banks and Wavelets - A System Theoretic Perspective

Sankar Basu

Journal of the Franklin Institute

Conference paper

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Frank R. Libsch, Takatoshi Tsujimura

Active Matrix Liquid Crystal Displays Technology and Applications 1997

Conference paper

Characterization of line width variation

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

SPIE Advanced Lithography 2000

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

View all publications

Abstract

Related

Multi-dimensional Filter Banks and Wavelets - A System Theoretic Perspective

Anomalous interface degradation of a-Si:H TFTs during LCD lifetime

Characterization of line width variation

Bounds on the ergodic capacity of training-based multiple-antenna systems