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

Quantum Simulators: Architectures and Opportunities

Ehud Altman, Kenneth R. Brown, et al.

PRX Quantum

Conference paper

Convergence properties of multi-dimensional stack filters

Peter Wendt

Electronic Imaging: Advanced Devices and Systems 1990

Conference paper

Self-assembling materials for lithographic patterning: Overview, status and moving forward

William Hinsberg, Joy Cheng, et al.

SPIE Advanced Lithography 2010

Paper

Parallel program schemata

Richard M. Karp, Raymond E. Miller

Journal of Computer and System Sciences

View all publications

Abstract

Related

Quantum Simulators: Architectures and Opportunities

Convergence properties of multi-dimensional stack filters

Self-assembling materials for lithographic patterning: Overview, status and moving forward

Parallel program schemata