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

IT service management automation - A hybrid methodology to integrate and orchestrate collaborative human centric and automation centric workflows

Naga Ayachitula, Melissa Buco, et al.

SCC 2007

Conference paper

Wavefront and caustic surfaces of refractive laser beam shaper

David L. Shealy, John A. Hoffnagle

SPIE Optical Engineering + Applications 2007

Paper

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

Vladimir Yanovski, Israel A. Wagner, et al.

Ann. Math. Artif. Intell.

Paper

Exploring context and content links in social media: A latent space method

Guo-Jun Qi, Charu Aggarwal, et al.

IEEE TPAMI

View all publications

Abstract

Related

IT service management automation - A hybrid methodology to integrate and orchestrate collaborative human centric and automation centric workflows

Wavefront and caustic surfaces of refractive laser beam shaper

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

Exploring context and content links in social media: A latent space method