2000 character limit reached
Notes on the sum of powers of the signless Laplacian eigenvalues of graphs
Published 6 Jun 2013 in math.CO | (1306.1386v1)
Abstract: For a graph $G$ and a non-zero real number $\alpha$, the graph invariant $S_{\alpha}(G)$ is the sum of the $\alpha{th}$ power of the non-zero signless Laplacian eigenvalues of $G$. In this paper, we obtain the sharp bounds of $S_{\alpha}(G)$ for a connected bipartite graph $G$ on $n$ vertices and a connected graph $G$ on $n$ vertices having a connectivity less than or equal to $k$, respectively, and propose some open problems for future research.
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.