Perturbation results for the Estrada index in weighted networks

Journal of Physics A: Mathematical and Theoretical

Volumn 44, Issue 7, 2011, Pages

  Shang, Yilun ^a  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79551668904     PISSN: 17518113     EISSN: 17518121     Source Type: Journal    
DOI: 10.1088/1751-8113/44/7/075003     Document Type: Article

References (20)

1. Bauer G and Bolch G 1990 Analytical approach to discrete optimization of queuing networks Comput. Commun. 13 494-502.
2. Biggs N 1993 Algebraic Graph Theory (New York: Cambridge University Press).
3. Brauer A 1952 Limits for the characteristic roots of a matrix: IV. Applications to stochastic matrices Duke Math. J. 19 75-91.
4. Cozzens M, Moazzami D and Stueckle S 1995 The tenacity of a graph 7th Int. Conf. on the Theory and Applications of Graphs pp 1111-22.
5. Cvetković D M, Doob M and Sachs H 1980 Spectra of Graphs: Theory and Application (New York: Academic).
6. de la Peña, J A, Gutman I and Rada J 2007 Estimating the Estrada index Linear Algebra Appl. 427 70-6.
7. Estrada E 2000 Characterization of 3D molecular structure Chem. Phys. Lett. 319 713-8.
8. Estrada E and Rodríguez-Velázquez J A 2005 Spectral measures of bipartivity in complex networks Phys. Rev. E 72 046105.
9. Estrada E and Rodríguez-Velázquez J A 2005 Subgraph centrality in complex networks Phys. Rev. E 71 056103.
10. Fiedler M 1973 Algebraic connectivity of graphs Czech. Math. J. 23 298-305.
11. Horn R A and Johnson C R 1985 Matrix Analysis (New York: Cambridge University Press).
12. Jung H 1978 On a class of posets and the corresponding comparability graphs J. Comb. Theory B 24 125-33.
13. Krishnamoorth M and Krishnamirthy B 1987 Fault diameter of interconnection networks Comput. Math. Appl. 13 577-82.
14. Lovász L 1993 Random walks on graphs: a survey Combinatorics, Paul Erdos is Eighty vol 2 (Keszthely: Bolyai Society Mathematical Studies) pp 1-46.
15. Mohar B 1989 Isoperimetric numbers of graphs J. Comb. Theory B 47 274-91.
16. Newman M E J 2003 The structure and function of complex networks SIAM Rev. 45 167-256.
17. Serra-Capizzano S 2005 Jordan canonical form of the Google matrix: a potential contribution to the Pagerank computation SIAM J. Matrix Anal. Appl. 27 305-12.
18. Wu J, Barahona M, Tan Y J and Deng H Z 2010 Natural connectivity of complex networks Chin. Phys. Lett. 27 078902.
19. Wu J, Barahona M, Tan Y J and Deng H Z 2010 Robustness of random graphs based on natural connectivity arXiv:1009.3430.
20. Wu J, Barahona M, Tan Y J and Deng H Z 2009 Robustness of regular graphs based on natural connectivity arXiv:0912.2144.