An improved result on Laplacian spectral ratio of connected graphs

被引：0

作者：

Lin, Zhen ^{[1
]}

Miao, Lianying ^{[1
]}

机构：

[1] China Univ Min & Technol, Sch Math, Xuzhou 221116, Jiangsu, Peoples R China

来源：

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2021年 / 42卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Laplacian eigenvalues; Ratio; Tree; Graph operations; ALGEBRAIC CONNECTIVITY; EIGENVALUES; TREES;

D O I：

10.1080/02522667.2020.1781883

中图分类号：

G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];

学科分类号：

1205 ; 120501 ;

摘要：

The Laplacian spectral ratio of a connected graph G, denoted by r(L)(G), is defined as the quotient between the largest and second smallest Laplacian eigenvalues of G. In 2002, Barahona and Pecora showed that rL(G) play an important role in the network synchronization control. In this paper, we obtain a result on the Laplacian spectral ratio of trees, which improve the known result of You and Liu [Z. You, B. Liu, On the Laplacian spectral ratio of connected graphs, Appl. Math. Lett. 25(2012)1245-1250]. Moreover, some graph operations on Laplacian spectral ratio arc given.

引用

页码：711 / 718

页数：8