Back to Search
Start Over
A NOTE ON SOME LOWER BOUNDS OF THE LAPLACIAN ENERGY OF A GRAPH.
- Source :
-
Transactions on Combinatorics . Jun2019, Vol. 8 Issue 2, p13-19. 7p. - Publication Year :
- 2019
-
Abstract
- For a simple connected graph G of order n and size m, the Laplacian energy of G is defined as LE(G) = where µ1,µ2,..., µn-1; µn are the Laplacian eigenvalues of G satisfying µ1 ≥ µ2 ≥ ... ≥ µn-1 > µn = 0. In this note, some new lower bounds on the graph invariant LE(G) are derived. The obtained results are compared with some already known lower bounds of LE(G). [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH connectivity
*EIGENVALUES
Subjects
Details
- Language :
- English
- ISSN :
- 22518657
- Volume :
- 8
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Transactions on Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 138164497
- Full Text :
- https://doi.org/10.22108/toc.2019.115269.1616