The Laplacian spectral ratio of connected graphs

arXiv2302.10491MaRDI QIDQ6427140FDOQ6427140

Jiajia Wang, Zhen Lin, Min Cai

Publication date: 21 February 2023

Abstract: Let $G$ be a simple connected undirected graph. The Laplacian spectral ratio of $G$, denoted by $R_L(G)$, is defined as the quotient between the largest and second smallest Laplacian eigenvalues of $G$, which is closely related to the structural parameters of a graph (or network), such as diameter, $t$-tough, perfect matching, average density of cuts, and synchronizability, etc. In this paper, we obtain some bounds of the Laplacian spectral ratio, which improves the known results. In addition, we give counter-examples on the upper bound of the Laplacian spectral ratio conjecture of trees, and propose a new conjecture.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05)

This page was built for publication: The Laplacian spectral ratio of connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6427140)