Upper bounds on the Laplacian energy of some graphs
The Laplacian energy L£[G] of a simple graph G with n vertices and m edges is equal to the sum of distances of the Laplacian eigenvalues to their average. For 1 ≤ j ≤ s, let Aj be matrices of orders n j. Suppose that det(L(G) - λIn) = Πj=1s det(Aj- - λI n,j)tj, with tj > 0. In the present paper w...
Autor principal: | |
---|---|
Outros Autores: | , , |
Formato: | article |
Idioma: | eng |
Publicado em: |
1000
|
Assuntos: | |
Texto completo: | http://hdl.handle.net/10773/4287 |
País: | Portugal |
Oai: | oai:ria.ua.pt:10773/4287 |