| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4598861 | Linear Algebra and its Applications | 2015 | 12 Pages |
Abstract
The Estrada index of a graph G is defined as EE(G)=∑i=1neλi, where λ1,λ2,…,λnλ1,λ2,…,λn are the eigenvalues of the adjacency matrix of G . Let Tnk be the set of the k-trees of order n . In this paper, we characterize the graphs among Tnk having the first (resp. the second) largest Estrada index.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Fei Huang, Shujing Wang,