Abstract

In this paper we give two results concerning the signless Laplacian spectra of simple graphs. Firstly, we give a combinatorial expression for the fourth coefficient of the (signless Laplacian) characteristic polynomial of a graph. Secondly, we consider limit points for the (signless Laplacian) eigenvalues and we prove that each non-negative real number is a limit point for (signless Laplacian) eigenvalue of graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call