Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
418663 | Discrete Applied Mathematics | 2015 | 6 Pages |
Abstract
Let GG be a simple graph of order nn, let λ1(G),λ2(G),…,λn(G)λ1(G),λ2(G),…,λn(G) be the eigenvalues of the adjacency matrix of GG. The Estrada index of GG is defined as EE(G)=∑i=1neλi(G). In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Long Wang, Yi-Zheng Fan, Yi Wang,