Interlacing eigenvalues and graphs
Interlacing eigenvalues and graphs
复制标题
DOI：
10.1016/0024-3795(95)00199-2
复制
发表时间：
1995-09
影响因子：
1.1
通讯作者：
W. Haemers
中科院分区：
文献类型：
--
作者：
W. Haemers
给出了特征值隔行法在图矩阵中的一些新的和旧的应用。根据标准邻接矩阵或拉普拉斯矩阵的特征值，获得图的特征数的边界，例如最大团的大小、色数、直径和带宽。我们还处理了关于图的结构和块设计的不等式和正则性结果。
We give several old and some new applications of eigenvalue interlacing to matrices associated to graphs. Bounds are obtained for characteristic numbers of graphs, such as the size of a maximal (co)clique, the chromatic number, the diameter, and the bandwidth, in terms of the eigenvalues of the standard adjacency matrix or the Laplacian matrix. We also deal with inequalities and regularity results concerning the structure of graphs and block designs.