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

Characterization of photoresist spatial resolution by interferometric lithography

John A. Hoffnagle, William D. Hinsberg, et al.

Microlithography 2003

Conference paper

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Juliann Opitz, Robert D. Allen, et al.

Microlithography 1998

Conference paper

Wavefront and caustic surfaces of refractive laser beam shaper

David L. Shealy, John A. Hoffnagle

SPIE Optical Engineering + Applications 2007

Paper

A nonlinear eigenvalue problem for rotating rods

F. Odeh, I. Tadjbakhsh

Archive for Rational Mechanics and Analysis

View all publications

Abstract

Related

Characterization of photoresist spatial resolution by interferometric lithography

Lithographic characteristics of 193-nm resists imaged at 193 and 248 nm

Wavefront and caustic surfaces of refractive laser beam shaper

A nonlinear eigenvalue problem for rotating rods