Please use this identifier to cite or link to this item
|title: ||Upper bounds on the Laplacian energy of some graphs|
|authors: ||Robbiano, M.|
Martins, E. A.
Martín, B. S.
|keywords: ||Laplacian matrix|
|issue date: ||2010|
|publisher: ||University of Kragujevac|
|abstract: ||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 we prove LE[G) ≤ Σ j=1stj√n j||Aj-2m/n||F≤ √n||L(G) - 2m/nIn||F , where ||·||F stands for the Frobenius matrix norm.|
|appears in collections||MAT - Artigos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.