A note on some lower bounds of the Laplacian energy of a graph
For a simple connected graph $G$ of order $n$ and size $m$, the Laplacian energy of $G$ is defined as $LE(G)=\sum_{i=1}^n|\mu_i-\frac{2m}{n}|$ where $\mu_1, \mu_2,\ldots,\mu_{n-1}, \mu_{n}$ are the Laplacian eigenvalues of $G$ satisfying $\mu_1\ge \mu_2\ge\cdots \ge \mu_{n-1}> \mu_...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
University of Isfahan
2019-06-01
|
| Col·lecció: | Transactions on Combinatorics |
| Matèries: | |
| Accés en línia: | https://toc.ui.ac.ir/article_23370_6285b197572578fd5d6ac1d563c9ba16.pdf |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|