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

Placement of multimedia blocks on zoned disks

Renu Tewari, Richard P. King, et al.

IS&T/SPIE Electronic Imaging 1996

Conference paper

EXAMPLES OF USING THE RESEARCH QUEUEING PACKAGE MODELING ENVIRONMENT (RESQME).

Robert F. Gordon, Edward A. MacNair, et al.

WSC 1985

Conference paper

Bonding, interfacial effects and adhesion in dlc

A. Grill, B.S. Meyerson, et al.

Proceedings of SPIE 1989

Paper

On the spectral radius of (0,1)-matrices

R.A. Brualdi, A.J. Hoffman

Linear Algebra and Its Applications

View all publications

Abstract

Related

Placement of multimedia blocks on zoned disks

EXAMPLES OF USING THE RESEARCH QUEUEING PACKAGE MODELING ENVIRONMENT (RESQME).

Bonding, interfacial effects and adhesion in dlc

On the spectral radius of (0,1)-matrices