Tricyclic graphs with exactly two main eigenvalues
Tricyclic graphs with exactly two main eigenvalues
复制标题
DOI：
10.2478/s11533-013-0283-z
复制
发表时间：
2010-12
影响因子：
--
通讯作者：
Xiaoxia Fan;Yanfeng Luo;Xing Gao
中科院分区：
文献类型：
--
作者：
Xiaoxia Fan;Yanfeng Luo;Xing Gao
如果图 G 的特征向量的项之和不等于 0，则该图 G 的特征值称为主特征值。设G0为G删除所有下垂顶点而得到的图，δ(G)为G的最小顶点度。本文确定了所有δ(G0)≥2且正好有两个主特征值的连通三环图G。
An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let G0 be the graph obtained from G by deleting all pendant vertices and δ(G) the minimum degree of vertices of G. In this paper, all connected tricyclic graphs G with δ(G0) ≥ 2 and exactly two main eigenvalues are determined.