New conjectures on algebraic connectivity and the Laplacian spread of graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:UA6QFGZ6record.jsonopen to challenge →
classification
math.CO
keywords
conjecturegraphslaplacianspreadalgebraicboundconjecturesconnectivity
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.