Abstract
Let G be a simple graph with n vertices and let μ1≥μ2≥⋯≥μn=0 be the Laplacian eigenvalues of G. The k-th Laplacian spectral moment of G is defined to be LMk(G)=∑i=1nμi k(G), where k is a non-negative integer; and the Laplacian Estrada index of G is defined as LEE(G)=∑i=1neμi . In this paper, we first estimate these two indices for almost all graphs, and then we give lower and upper bounds to these two indices for almost all multipartite graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 1299-1307 |
| Number of pages | 9 |
| Journal | Journal of Mathematical Analysis and Applications |
| Volume | 461 |
| Issue number | 2 |
| DOIs | |
| State | Published - 15 May 2018 |
Keywords
- Erdős–Rényi random graph
- Laplacian Estrada index
- Laplacian spectral moment
- Random multipartite graph
Fingerprint
Dive into the research topics of 'Laplacian spectral moment and Laplacian Estrada index of random graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver