Abstract
For a simple and connected graph, a new graph invariant , defined as the sum of powers of the eigenvalues of the normalized Laplacian matrix, has been introduced by Bozkurt and Bozkurt in [7]. Lower and upper bounds have been proposed by the authors. In this paper, we localize the eigenvalues of the normalized Laplacian matrix by adapting a theoretical method, proposed in Bianchi and Torriero ([5]), based on majorization techniques. Through this approach we derive upper and lower bounds of . Some numerical examples show how sharper results can be obtained with respect to those existing in literature.
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.