For a simple and connected graph, several lower and upper bounds of graph invariants expressed in terms of the eigenvalues of the normalized Laplacian matrix have been proposed in literature. In this paper, through a unified approach based on majorization techniques, we provide some novel inequalities depending on additional information on the localization of the eigenvalues of the normalized Laplacian matrix. Some numerical examples show how sharper results can be obtained with respect to those existing in literature.
