圖的拉普拉斯譜半徑

Abstract

令G=(V,E)是一個點集V和邊集E的簡單連通圖。我們有一個新的拉普拉斯譜半徑的極值上界，而這個上界改進了一些已知的結果。

Let G=(V,E) be a simple connected graph with the vertex set V and the edge set E. We have a new sharp bound for the Laplacian spectral radius of $G$, which improves some known upper bounds.