Resumen de An Upper Bound on The Largest Signless Laplacian of an Odd Unicyclic Graph

Macarena Collao, Pamela Pizarro, Óscar Luis Rojo Jeraldo

• We derive an upper bound on the largest signless Laplacian eigen­value of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained re­moving the edges of the unique cycle in the graph.