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

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ

A. Gupta, R. Gross, et al.

SPIE Advances in Semiconductors and Superconductors 1990

Conference paper

Surface light-induced changes in thin polymer films

Andrew Skumanich

SPIE Optics Quebec 1993

Paper

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Charles A Micchelli

Journal of Approximation Theory

Paper

Soft decoding of several classes of array codes

Mario Blaum, John L. Fan, et al.

IEEE International Symposium on Information Theory - Proceedings

View all publications

Abstract

Related

Growth and transport properties of multilayer superconducting films of Nd1.83Ce0.17CuOx / YBa2Cu3O7-δ

Surface light-induced changes in thin polymer films

Best L1 approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines

Soft decoding of several classes of array codes

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ

Best L¹ approximation by weak chebyshev systems and the uniqueness of interpolating perfect splines