2000 character limit reached
On two conjectures on sum of the powers of signless Laplacian eigenvalues of a graph
Published 4 Aug 2014 in math.CO | (1408.0639v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.