The Laplacian Spread of Tricyclic Graphs

被引：0

作者：

Chen, Yanqing ^{[1
]}

Wang, Ligong ^{[1
]}

机构：

[1] NW Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R China

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2009年 / 16卷 / 01期

基金：

中国国家自然科学基金;

关键词：

EIGENVALUES;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.

引用

页数：18

共 18 条

[1]

Anderson W.N., 1985, Linear Multilinear Algebra, V18, P141, DOI [10.1080/03081088508817681, DOI 10.1080/03081088508817681]

[2]

[Anonymous], 1991, GRAPH THEORY COMBINA

[3]

BAO Y, 2009, APPL MATH L IN PRESS

[4] An improved upper bound for Laplacian graph eigenvalues [J].

Das, KC .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2003, 368 :269-278

[5]

FAN Y, LEPLACIAN SPRE UNPUB

[6]

Fan YZ, 2008, DISCRETE MATH THEOR, V10, P79

[7] The spread of the spectrum of a graph [J].

Gregory, DA ;

Hershkowitz, D ;

Kirkland, SJ .

LINEAR ALGEBRA AND ITS APPLICATIONS, 2001, 332 :23-35

[8]

GRONE R, 1994, SIAM J DISCRETE MATH, V7, P229

[9] LOWER BOUNDS FOR THE SPREAD OF A MATRIX [J].

JOHNSON, CR ;

KUMAR, R ;

WOLKOWICZ, H .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1985, 71 (NOV) :161-173

[10] A bound on the algebraic connectivity of a graph in terms of the number of cutpoints [J].

Kirkland, S .

LINEAR & MULTILINEAR ALGEBRA, 2000, 47 (01) :93-103

← 1 2 →