Effective graph resistance

Linear Algebra and Its Applications

Volumn 435, Issue 10, 2011, Pages 2491-2506

  Ellens, W ^a,b   Spieksma, F M ^a   Van Mieghem, P ^c   Jamakovic, A ^b   Kooij, R E ^b,c  

^a LEIDEN UNIVERSITY   (Netherlands)

^b Information and Communication Technology   (Netherlands)

^c Delft University of Technology ^*  (Netherlands)

Author keywords

Effective resistance; Graph spectrum; Laplacian eigenvalues; Network robustness; Optimisation

Indexed keywords

EFFECTIVE RESISTANCE; GRAPH SPECTRUM; LAPLACIAN EIGENVALUES; NETWORK ROBUSTNESS; OPTIMISATIONS;

EIGENVALUES AND EIGENFUNCTIONS; ELECTRIC NETWORK ANALYSIS; MARKOV PROCESSES; OPTIMIZATION;

GRAPH THEORY;

EID: 79958858010     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2011.02.024     Document Type: Article

References (16)

1. D. Aldous, J.A. Fill, Reversible Markov chains and random walks on graphs, in preparation. Available from: < www.stat.berkeley.edu/∼aldous/ RWG/book >.
2. A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari The electrical resistance of a graph captures its commute and cover times Proc. 21st Ann. ACM Symp. Theor. Comp. 1989 ACM Press Seattle 574 586
3. D.M. Cvetković, M. Doob, and H. Sachs Spectra of Graphs, Theory and Applications 1995 Johann Ambrosius Barth Verlag Heidelberg-Leipzig
4. W. Ellens, Network robustness, Master thesis, Mathematical Institute, University of Leiden, 2011. Available from: < www.math.leidenuniv.nl/en/ theses/ >.
5. M. Fiedler Algebraic connectivity of graphs Czechoslovak Math. J. 23 1973 298 305
6. D.J. Klein, and M. Randić Resistance distance J. Math. Chem. 12 1993 81 95
7. B. Mohar The Laplacian spectrum of graphs Graph Theory, Combinatorics, and Applications: Proc. Sixth Quadrennial Int. Conf. on the Theory and Applications of Graph vol. 2 1991 Wiley Interscience Kalamazoo 871 898
8. Sh.M. Ross Applied Probability Models with Optimization Applications 2010 Holden Day San Francisco, USA
9. E. Seneta Non-negative Matrices and Markov Chains second ed. 1981 Springer-Verlag Berlin
10. W. So Rank one perturbation and its application to Laplacian spectrum of a graph Linear and Multilinear Algebra 46 3 1999 193 198
11. A. Tizghadam, and A. Leon-Garcia On robust traffic engineering in core networks Global Telecommunications Conference 2008 IEEE GLOBECOM 1 6
12. E.R. van Dam Graphs with given diameter maximizing the spectral radius Linear Algebra Appl. 426 2007 457 545
13. P. Van Mieghem, H. Wang, Spectra of a new class of graphs with extremal properties, Report 2009 1010, Delft University of Technology, 2009. Available from: .
14. P. Van Mieghem Graph Spectra for Complex Networks 2011 Cambridge University Press Cambridge, UK
15. H. Wang, R.E. Kooij, and P. Van Mieghem Graphs with given diameter maximizing the algebraic connectivity Linear Algebra Appl. 433 11 2010 1889 1908
16. E.W. Weisstein, Resistance-Equivalent Graphs. Available from: .