Laplacian energy of a graph (Q819756): Difference between revisions

From MaRDI portal
Normalize DOI.
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2005.09.008 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2005.09.008 / rank
 
Normal rank

Latest revision as of 04:05, 10 December 2024

scientific article
Language Label Description Also known as
English
Laplacian energy of a graph
scientific article

    Statements

    Laplacian energy of a graph (English)
    0 references
    0 references
    0 references
    29 March 2006
    0 references
    The authors introduce the concept of Laplacian energy of a graph \(G\) by letting \(LE(G)=\sum_{i=1}^n | \mu_i - \frac{2m}{n}| \), where \(\mu_i\), \(i=1,\dots,n\), are the eigenvalues of the Laplacian matrix of \(G\). They show that the above definition is well chosen and much in analogy with the usual graph energy \(E(G)\), which is the sum of absolute values of eigenvalues of the adjacency matrix of \(G\). Indeed, they do coincide in the case of regular graphs. In the rest of the paper, the authors prove for \(LE(G)\) the analogues of several inequalities that hold for \(E(G)\).
    0 references
    graph spectrum
    0 references
    Laplacian eigenvalues
    0 references

    Identifiers