| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872544 | Discrete Applied Mathematics | 2014 | 9 Pages |
Abstract
Let G be a simple connected graph on n vertices and λ1,λ2,â¦,λn be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G)=âi=1neλi. Let Tn be the class of tricyclic graphs G on n vertices. In this paper, the graphs in Tn with the maximal Estrada index is characterized.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Zhongxun Zhu, Liansheng Tan, Zhongyi Qiu,