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

Byzantine-Robust Decentralized Federated Learning

Minghong Fang, Zifan Zhang, et al.

CCS 2024

Conference paper

True 3-D displays for avionics and mission crewstations

Elizabeth A. Sholler, Frederick M. Meyer, et al.

SPIE AeroSense 1997

Conference paper

Generative Adversarial Symmetry Discovery

Jianke Yang, Robin Walters, et al.

ICML 2023

Conference paper

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ

A. Gupta, R. Gross, et al.

SPIE Advances in Semiconductors and Superconductors 1990

View all publications

Abstract

Related

Byzantine-Robust Decentralized Federated Learning

True 3-D displays for avionics and mission crewstations

Generative Adversarial Symmetry Discovery

Growth and transport properties of multilayer superconducting films of Nd1.83Ce0.17CuOx / YBa2Cu3O7-δ

Growth and transport properties of multilayer superconducting films of Nd_1.83Ce_0.17CuO_x / YBa₂Cu₃O_7-δ