Some observations on the smallest adjacency eigenvalue of a graph

DOI10.7151/dmgt.2285zbMath1433.05189arXiv1912.03957MaRDI QIDQ2295999

David A. Gregory, Sebastian M. Cioabă, Randall J. Elzinga

Publication date: 17 February 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.03957

zbMATH Keywords

maximum cut; adjacency matrix; smallest eigenvalue; clique partition; graph decomposition; claw-free graphs; graph spectrum

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

05C75: Structural characterization of families of graphs

05C76: Graph operations (line graphs, products, etc.)