A Note on Some Bounds of the α-Estrada Index of Graphs
Let G be a simple graph with n vertices. Let A~αG=αDG+1−αAG, where 0≤α≤1 and AG and DG denote the adjacency matrix and degree matrix of G, respectively. EEαG=∑i=1neλi is called the α-Estrada index of G, where λ1,⋯,λn denote the eigenvalues of A~αG. In this paper, the upper and lower bounds for EEαG...
Saved in:
Main Authors: | Yang Yang, Lizhu Sun, Changjiang Bu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Advances in Mathematical Physics |
Online Access: | http://dx.doi.org/10.1155/2020/3972789 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Some Properties on Estrada Index of Folded Hypercubes Networks
by: Jia-Bao Liu, et al.
Published: (2014-01-01) -
Some New Upper Bounds for the Y-Index of Graphs
by: Durbar Maji, et al.
Published: (2022-01-01) -
Bounds for the Kirchhoff Index of Bipartite Graphs
by: Yujun Yang
Published: (2012-01-01) -
New Bounds for the Randić Index of Graphs
by: Maryam Atapour, et al.
Published: (2021-01-01) -
On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
by: Faxu Li, et al.
Published: (2014-01-01)