Abstract
Let G be a graph with n vertices and m edges. Also let μ1, μ2,.,μn-1,μn=0 be the eigenvalues of the Laplacian matrix of graph G. The Laplacian energy of the graph G is defined as LE=LE(G)=Σi=1n|μi-2mn|. In this paper, we present some lower and upper bounds for LE of graph G in terms of n, the number of edges m and the maximum degree Δ. Also we give a Nordhaus-Gaddum-type result for Laplacian energy of graphs. Moreover, we obtain a relation between Laplacian energy and Laplacian-energy-like invariant of graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 52-64 |
| Number of pages | 13 |
| Journal | Discrete Mathematics |
| Volume | 325 |
| Issue number | 1 |
| DOIs | |
| State | Published - 28 Jun 2014 |
Keywords
- Graph
- Laplacian eigenvalues
- Laplacian energy
- Laplacian matrix
- Laplacian-energy-like invariant
Fingerprint
Dive into the research topics of 'On Laplacian energy of graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver