On a conjecture for the signless Laplacian eigenvalues
arXiv:1306.0093
Abstract
Let be a simple graph with vertices and edges, and be the signless Laplacian eigenvalues of Let where F. Ashraf et al. conjectured that for In this paper, we give various upper bounds for and prove that this conjecture is true for the following cases: connected graph with sufficiently large unicyclic graphs and bicyclic graphs for all and tricyclic graphs when
13 pages, 5 figures