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

Motion video analysis using planar parallax

Harpreet S. Sawhney

IS&T/SPIE Electronic Imaging 1994

Paper

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

Charles A Micchelli

Journal of Approximation Theory

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

Hans Becker, Frank Schmidt, et al.

Photomask and Next-Generation Lithography Mask Technology 2004

View all publications

Abstract

Related

Motion video analysis using planar parallax

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

A generic grouping algorithm and its quantitative analysis

Performance data on new tunable attenuating PSM for 193nm and 157nm lithography

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