首页|Real symmetric matrices and their negative eigenvalues
Real symmetric matrices and their negative eigenvalues
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
For two integers k >= 0 and q >= 1, consider symmetric matrices Mwith knegative eigenvalues counted with multiplicities and qpairwise distinct values of entries such that the rows of Mare mutually distinct and the largest diagonal entry of Mis less than or equal to the smallest off-diagonal entry of M. It is shown that the number of such matrices is finite when kand qare fixed. This generalizes some known results on the adjacency matrices of graphs. It is conjectured that any twinfree graph on nvertices with no isolated vertices has at least -1 + log(2)( n + 2) negative adjacency eigenvalues. (C) 2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
