Some Properties on Estrada Index of Folded Hypercubes Networks

Jia-Bao Liu, Xiang-Feng Pan and Jinde Cao

Abstract and Applied Analysis, 2014, vol. 2014, issue 1

Abstract: Let G be a simple graph with n vertices and let λ1, λ2, …, λn be the eigenvalues of its adjacency matrix; the Estrada index EE(G) of the graph G is defined as the sum of the terms eλi, i = 1,2, …, n. The n‐dimensional folded hypercube networks FQn are an important and attractive variant of the n‐dimensional hypercube networks Qn, which are obtained from Qn by adding an edge between any pair of vertices complementary edges. In this paper, we establish the explicit formulae for calculating the Estrada index of the folded hypercubes networks FQn by deducing the characteristic polynomial of the adjacency matrix in spectral graph theory. Moreover, some lower and upper bounds for the Estrada index of the folded hypercubes networks FQn are proposed.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2014/167623

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:167623

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().