Let G be a graph on n vertices and lambda(1), lambda(2), . . . , lambda(n) its eigenvalues. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. In this paper, we present some new lower bounds for the Estrada index of graphs and in particular of bipartite graphs that only depend on the number of vertices, the number of edges, Randic index, maximum and minimum degree and diameter. (C) 2021 Elsevier B.V. All rights reserved.
机构:
Hunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R ChinaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
机构:
Hunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R ChinaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
Deng, Hanyuan
Zhang, Jie
论文数: 0引用数: 0
h-index: 0
机构:
City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R ChinaHunan Normal Univ, Coll Math & Comp Sci, Changsha 410081, Hunan, Peoples R China
机构:
Zhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou 363000, Fujian, Peoples R ChinaZhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou 363000, Fujian, Peoples R China
Li, Jianxi
Shiu, Wai Chee
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Baptist Univ, Dept Math, Kowloon, Hong Kong, Peoples R ChinaZhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou 363000, Fujian, Peoples R China
Shiu, Wai Chee
Chan, Wai Hong
论文数: 0引用数: 0
h-index: 0
机构:
Hong Kong Baptist Univ, Dept Math, Kowloon, Hong Kong, Peoples R ChinaZhangzhou Normal Univ, Dept Math & Informat Sci, Zhangzhou 363000, Fujian, Peoples R China