| | |
| | |
Stat |
Members: 3645 Articles: 2'500'096 Articles rated: 2609
18 April 2024 |
|
| | | |
|
Article overview
| |
|
Maximum Estrada Index of Bicyclic Graphs | Long Wang
; Yi-Zheng Fan
; Yi Wang
; | Date: |
17 Apr 2012 | Abstract: | 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. | Source: | arXiv, 1204.3686 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |