On the Spectral Spread of Bicyclic Graphs with Given Girth

被引：0

作者：

Bing WANG ^{[1
]}

Ming-qing ZHAI ^{[1
]}

Jin-long SHU ^{[2
]}

机构：

[1] School of Mathematical Science,Chuzhou University

[2] Department of Mathematics,East China Normal University

来源：

Acta Mathematicae Applicatae Sinica | 2013年 / 03期

基金：

中国博士后科学基金; 中国国家自然科学基金;

关键词：

bicyclic graph; least eigenvalue; spectral spread;

D O I：

暂无

中图分类号：

O157.5 [图论];

学科分类号：

070104 ;

摘要：

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

页数：12

共 4 条

[1]

Maximizing the spectral radius of bicyclic graphs with fixed girth [J] . Mingqing Zhai,Yarong Wu,Jinlong Shu.&nbsp&nbspLinear Algebra and Its Applications . 2009 (5)

[2]

Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread [J] . Yi-Zheng Fan,Yi Wang,Yu-Bin Gao.&nbsp&nbspLinear Algebra and Its Applications . 2008 (2)

[3]

Graphs for which the least eigenvalue is minimal, I [J] . &nbsp&nbspLinear Algebra and Its Applications . 2008 (1)

[4]

The spread of the spectrum of a graph [J] . DavidA. Gregory,Daniel Hershkowitz,StephenJ. Kirkland.&nbsp&nbspLinear Algebra and Its Applications . 2001

← 1 →