Improved lower bounds on the extrema of eigenvalues of graphs
Combinatorics
2023-06-21 v2
Abstract
In this note, we improve the lower bounds for the maximum size of the th largest eigenvalue of the adjacency matrix of a graph for several values of . In particular, we show that closed blowups of the icosahedral graph improve the lower bound for the maximum size of the fourth largest eigenvalue of a graph, answering a question of Nikiforov.
Keywords
Cite
@article{arxiv.2304.12324,
title = {Improved lower bounds on the extrema of eigenvalues of graphs},
author = {William Linz},
journal= {arXiv preprint arXiv:2304.12324},
year = {2023}
}
Comments
Minor revisions