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

Compound semiconductor surface and interface problems in liquid phase epitaxy (lpe)

M.B. Small, R.M. Potemski

Proceedings of SPIE 1989

Paper

Neural network based iterative learning control for product qualities in batch processes

Zhihua Xiong, Yixin Xu, et al.

International Journal of Modelling, Identification and Control

Conference paper

Changes of T_c under epitaxial strain: Implications for the mechanism of superconductivity

J.P. Locquet, J. Perret, et al.

SPIE Optical Science, Engineering, and Instrumentation 1998

Paper

An information statistics approach to data stream and communication complexity

Ziv Bar-Yossef, T.S. Jayram, et al.

Journal of Computer and System Sciences

View all publications

Abstract

Related

Compound semiconductor surface and interface problems in liquid phase epitaxy (lpe)

Neural network based iterative learning control for product qualities in batch processes

Changes of Tc under epitaxial strain: Implications for the mechanism of superconductivity

An information statistics approach to data stream and communication complexity

Changes of T_c under epitaxial strain: Implications for the mechanism of superconductivity