On the Multiplicities of Graph Eigenvalues

On the Multiplicities of Graph Eigenvalues
复制标题

DOI:
10.1112/s0024609303002030
复制
发表时间:
2003-05
影响因子:
0.9
通讯作者:
F. K. Bell;P. Rowlinson
F. K. Bell;P. Rowlinson
中科院分区:
数学3区
文献类型:
--
作者:
F. K. Bell;P. Rowlinson

文献摘要

被引文献

相似文献

利用星星补和相关的二次函数,得到了特征空间具有给定余维数的图的阶的一个精确上界。证明了正则图G的界可约1,且正则图G可约1当且仅当G是极强正则图。2000年数学学科分类05C50。
Star complements and associated quadratic functions are used to obtain a sharp upper bound for the order of a graph with an eigenspace of prescribed codimension. It is shown that for regular graphs the bound can be reduced by 1, and that this reduced bound is attained by a regular graph G if and only if G is an extremal strongly regular graph. 2000 Mathematics Subject Classification 05C50.