A conjecture on square roots of Laplacian and signless Laplacian eigenvalues of graphs
classification
🧮 math.CO
keywords
laplacianeigenvaluesrootssquareconjecturesignlessexceedgraph
read the original abstract
We conjecture that the sum of the square roots of the Laplacian eigenvalues of a graph does not exceed the sum of the square roots of its signless Laplacian eigenvalues.
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.