Some Observations on the Smallest Adjacency Eigenvalue of a Graph

In this paper, we discuss various connections between the smallest eigenvalue of the adjacency matrix of a graph and its structure. There are several techniques for obtaining upper bounds on the smallest eigenvalue, and some of them are based on Rayleigh quotients, Cauchy interlacing using induced s...

Full description

Bibliographic Details

Published in:	Discussiones Mathematicae Graph Theory
Main Authors:	Cioabă Sebastian M., Elzinga Randall J., Gregory David A.
Format:	Article
Language:	English
Published:	University of Zielona Góra 2020-05-01
Subjects:	graph spectrum smallest eigenvalue adjacency matrix graph decomposition clique partition claw-free graphs maximum cut 05c50 05c75 05c76 05e30 15a18
Online Access:	https://doi.org/10.7151/dmgt.2285