文章引用说明 更多>> (返回到该文章)

van Dam, E.R. (1998) Graphs with Few Distinct Eigenvalues, Where Most of the Times Few Means Three or Four. Journal of Combinatorial Theory, Series B, 73, 101-118.
http://dx.doi.org/10.1006/jctb.1998.1815

被以下文章引用:

• 标题: 具有不同特征值的连通图Connected Graphs with Distinct Eigenvalues

  作者: 李国政

  关键字: Q-矩阵, 邻接矩阵, 特征值, 图的谱Department of Mathematics, Qinghai Normal University, Xining Qinghai

  期刊名称: 《Advances in Applied Mathematics》, Vol.5 No.1, 2016-02-24

  摘要: 关于图的Q-矩阵和邻接矩阵，给出了具有k个不同特征值的连通图的充分必要条件。 A necessary and sufficient condition for graphs with k distinct eigenvalues is determined for Q- matrix and adjacency matrix.