Abstract
For a graph and a non-zero real number , the graph invariant is the sum of the power of the non-zero signless Laplacian eigenvalues of . In this paper, we obtain the sharp bounds of for a connected bipartite graph on vertices and a connected graph on vertices having a connectivity less than or equal to , respectively, and propose some open problems for future research.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.