On two conjectures on sum of the powers of signless Laplacian eigenvalues of a graph
classification
🧮 math.CO
keywords
alphaconjectureseigenvaluesgraphgraphslaplacianpowerssignless
read the original abstract
Let $G$ be a simple graph and $Q(G)$ be the signless Laplacian matrix of $G$. Let $S_\alpha(G)$ be the sum of the $\alpha$-th powers of the nonzero eigenvalues of $Q(G)$. We disprove two conjectures by You and Yang on the extremal values of $S_\alpha(G)$ among bipartite graphs and among graphs with bounded connectivity.
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.