首页|New conjectures on algebraic connectivity and the Laplacian spread of graphs
New conjectures on algebraic connectivity and the Laplacian spread of graphs
扫码查看
点击上方二维码区域,可以放大扫码查看
原文链接
NSTL
Elsevier
We conjecture a new lower bound on the algebraic connectivity of a graph that involves the number of vertices of high eccentricity in a graph. We prove that this lower bound implies a strengthening of the Laplacian Spread Conjecture. We discuss further conjectures, also strengthening the Laplacian Spread Conjecture, that include a conjecture for simple graphs and a conjecture for weighted graphs. (c) 2022 Elsevier Inc. All rights reserved.