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, 1-6

Abstract:

Let be a simple graph with vertices and let be the eigenvalues of its adjacency matrix; the Estrada index of the graph is defined as the sum of the terms ,   . The -dimensional folded hypercube networks are an important and attractive variant of the -dimensional hypercube networks , which are obtained from 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 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 are proposed.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/AAA/2014/167623.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2014/167623.xml (text/xml)

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:hin:jnlaaa:167623

DOI: 10.1155/2014/167623

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().