2000 character limit reached
Note on the Sum of Powers of Signless Laplacian Eigenvalues of Graphs
Published 18 Nov 2014 in math.CO | (1411.4850v1)
Abstract: For a simple graph $G$ and a real number $\alpha $ $\left(\alpha \neq 0,1\right) $ the graph invariant $s_{\alpha}\left(G\right) $ is equal to the sum of powers of signless Laplacian eigenvalues of $G$. In this note, we present some new bounds on $s_{\alpha}\left(G\right) $. As a result of these bounds, we also give some results on incidence energy.
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.