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...

Full description

Saved in:
Bibliographic Details
Published inAdvances in mathematical physics Vol. 2020; no. 2020; pp. 1 - 11
Main Authors Yang, Yang, Bu, C., Sun, Lizhu
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 2020
Hindawi
Hindawi Limited
Wiley
Subjects
Apexes
Eigenvalues
Energy
Graph theory
Graphs
Inequality
Lower bounds
Online AccessGet full text

Cover

More Information
Summary: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 are given. Moreover, some relations between the α-Estrada index and α-energy are established.
ISSN:1687-9120
1687-9139
DOI:10.1155/2020/3972789