An improved result on Laplacian spectral ratio of connected graphs. Issue 4 (19th May 2021)

• Record Type: Journal Article
• Authors: Lin, Zhen; Miao, Lianying
• Is Part Of: Journal of information & optimization sciences. Volume 42:Issue 4(2021)
• Page Start: 711
• Page End: 718
• Publication Date: 2021-05-19
• Subjects: 05C50 -- 05C76; Laplacian eigenvalues -- Ratio -- Tree -- Graph operations; Electronic data processing -- Periodicals; Information science -- Periodicals; Mathematical optimization -- Periodicals; 519.6
• DOI: 10.1080/02522667.2020.1781883
• Languages: English
• ISSNs: 0252-2667

Abstract

Abstract: 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 are given.