On the spectral radius of bicyclic graphs with n vertices and diameter d

被引：20

作者：

Guo, Shu-Guang ^{[1
]}

机构：

[1] Yancheng Teachers Coll, Dept Math, Jiangsu 224002, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2007年 / 422卷 / 01期

关键词：

bicyclic graphs; eigenvalues; spectral radius; diameter;

D O I：

10.1016/j.laa.2006.09.011

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Bicyclic graphs are connected graphs in which the number of edges equals the number of vertices Plus one. In this paper we determine the graph with the largest spectral radius among all bicyclic graphs with 11 vertices and diameter d. As an application, we give first three graphs among all bicyclic graphs on n vertices, ordered according to their spectral radii in decreasing order. (c) 2006 Elsevier Inc. All rights reserved.

引用

页码：119 / 132

页数：14

共 17 条

[1] On the spectral radius of graphs with cut vertices [J].

Berman, A ;

Zhang, XD .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2001, 83 (02) :233-240

[2]

Brualdi R. A., 1986, PUBL I MATH-BEOGRAD, V39, P45

[3] On the index of bicyclic graphs with perfect matchings [J].

Chang, A ;

Tian, F ;

Yu, AM .

DISCRETE MATHEMATICS, 2004, 283 (1-3) :51-59

[4]

Cvetkovic D., 1995, Spectra of Graphs-Theory and Application, V3rd ed.

[5]

CVETKOVIC D, 1990, LINEAR MULTILINEAR A, V28, P3, DOI DOI 10.1080/03081089008818026

[6] On the spectral radius of trees with fixed diameter [J].

Guo, JM ;

Shao, JY .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 413 (01) :131-147

[7] The spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices [J].

Guo, SG .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 408 :78-85

[8]

GUO SG, UNPUB AUSTRALAS J CO

[9]

[郭曙光 GUO Shuguang], 2005, [数学进展, Advances in Mathematics], V34, P683

[10]

Hoffman A.J., 1975, Recent advances in Graph Theory, P273

← 1 2 →