Foster's formulas via probability and the Kirchhoff index

Methodology and Computing in Applied Probability

Volumn 6, Issue 4, 2004, Pages 381-387

  Palacios, José Luis ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

Effective resistance; Geodetic graphs

Indexed keywords

EID: 25844511350     PISSN: 13875841     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MCAP.0000045086.76839.54     Document Type: Article

References (12)

1. B. Bollobás, Modern Graph Theory, Springer: New York, 1998.
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," In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, pp. 574-586, 1989.
3. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-regular graphs, Springer: Berlin, 1989.
4. D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, "Random walks on weighted graphs and applications to online algorithms," In Proceedings of the 22nd Symposium on the Theory of Computing, pp. 369-378, 1990.
5. P. G. Doyle and J. L. Snell, Random walks and electrical networks, The Mathematical Association of America: Washington, D.C., 1984.
6. R. M. Foster, "The average impedance of an electrical network," In Contributions to Applied Mechanics (Reissner Aniversary Volume); Edwards Brothers, Ann Arbor, MI, pp. 333-340, 1949.
7. R. M. Foster, "An extension of a network theorem," IRE Transactions on Circuit Theory vol. 8 pp. 75-76, 1961.
8. D. Klein and M. Randić, "Resistance distance," Journal of Mathematical Chemistry vol. 12 pp. 81-95, 1993.
9. J. L. Palacios, "Resistance distance in graphs and random walks," International Journal of Quantum Chemistry vol. 81 pp. 29-33, 2001a.
10. J. L. Palacios, "Closed-form formulas for Kirchhoff index," International Journal of Quantum Chemistry vol. 81 pp. 135-140, 2001b.
11. P. Tetali, "Random walks and the effective resistance of networks," Journal of Theoretical Probability vol. 4 pp. 101-109, 1991.
12. P. Tetali, "An extension of Foster's network theorem," Combinatorics, Probability and Computing vol. 3 pp. 421-427, 1994.