New Bounds for the Laplacian Spectral Radius of a Signed Graph
classification
🧮 math.CO
keywords
boundsgraphlaplacianradiusspectralobtainsigneddepend
read the original abstract
We obtain new bounds for the Laplacian spectral radius of a signed graph. Most of these new bounds have a dependence on edge sign, unlike previously known bounds, which only depend on the underlying structure of the graph. We then use some of these bounds to obtain new bounds for the Laplacian and signless Laplacian spectral radius of an unsigned graph by signing the edges all positive and all negative, respectively.
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.