A Note on the Maximal Estrada Index of Trees with a Given Bipartition

作者：Li Jing^*

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2011, 66(3): 765-768.

Let G be a simple graph with n vertices and let lambda(1), lambda(2), ..., lambda(n) be the eigenvalues of its adjacency matrix. The Estrada index EE of G is the sum of the terms e(lambda i). Let T(p, q) denote the set of all trees with a given (p, q)-bipartition, where q >= p >= 2. And D(p, q) denotes the double star which is obtained by joining the centers of two stars S(p) and S(q) by an edge. In this note, we will show that D(p,q) has the maximal Estrada index in T(p, q).

• 出版日期2011
• 单位南开大学