共 50 条
On the spectral spread of bicyclic graphs with given girth
被引:0
|作者:
Bing Wang
Ming-qing Zhai
Jin-long Shu
机构:
[1] Chuzhou University,School of Mathematical Science
[2] East China Normal University,Department of Mathematics
来源:
关键词:
bicyclic graph;
least eigenvalue;
spectral spread;
05C50;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
The spectral spread of a graph is defined to be the difference between the largest and the least eigenvalue of the adjacency matrix of the graph. A graph G is said to be bicyclic, if G is connected and |E(G)| = |V (G)| + 1. Let B(n, g) be the set of bicyclic graphs on n vertices with girth g. In this paper some properties about the least eigenvalues of graphs are given, by which the unique graph with maximal spectral spread in B(n, g) is determined.
引用
收藏
页码:517 / 528
页数:11
相关论文