An upper bound on the largest signless Laplacian of an odd unicyclic graph

we derive an upper bound on the largest signless laplacian eigenvalue of an odd unicyclic graph. the bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.