Improved Lower Bounds on the Extrema of Eigenvalues of Graphs

被引：0

作者：

William Linz

机构：

[1] University of South Carolina,

来源：

Graphs and Combinatorics | 2023年 / 39卷

关键词：

Eigenvalues; Icosahedral graph; kth largest eigenvalue; 05C50; 05D99;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this note, we improve the lower bounds for the maximum size of the kth largest eigenvalue of the adjacency matrix of a graph for several values of k. 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.

引用