Maximum Estrada Index of Bicyclic Graphs

Details Maximum Estrada Index of Bicyclic Graphs Maximum Estrada Index of Bicyclic Graphs

2012-04-17

arxiv.org/abs/1204.3686v1

Mathematics

Combinatorics

Scientific paper

Let $G$ be a simple graph of order $n$, let
$\lambda_1(G),\lambda_2(G),...,\lambda_n(G)$ be the eigenvalues of the
adjacency matrix of $G$. The Esrada index of $G$ is defined as
$EE(G)=\sum_{i=1}^{n}e^{\lambda_i(G)}$. In this paper we determine the unique
graph with maximum Estrada index among bicyclic graphs with fixed order.

Affiliated with

Also associated with

No associations

Rating

Maximum Estrada Index of Bicyclic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum Estrada Index of Bicyclic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Estrada Index of Bicyclic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289198