IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v6y2004i4d10.1023_bmcap.0000045086.76839.54.html
   My bibliography  Save this article

Foster's Formulas via Probability and the Kirchhoff Index

Author

Listed:
  • José Luis Palacios

    (Universidad Simón Bolívar)

Abstract

Building on a probabilistic proof of Foster’s first formula given by Tetali (1994), we prove an elementary identity for the expected hitting times of an ergodic N-state Markov chain which yields as a corollary Foster’s second formula for electrical networks, namely $$\sum {R_{ij} } \frac{{C_{iv} C_{vj} }}{{C_v }} = N - 2,$$ where R ij is the effective resistance, as computed by means of Ohm’s law, measured across the endpoints of two adjacent edges (i,v) and (i,v), C iv and C iv are the conductances of these edges, C v is the sum of all conductances emanating from the common vertex v, and the sum on the left hand side of (1) is taken over all adjacent edges. We show how to extend Foster’s first and second formulas. As an application, we show how to use a “third formula” to compute the Kirchhoff index of a class of graphs with diameter 3.

Suggested Citation

  • José Luis Palacios, 2004. "Foster's Formulas via Probability and the Kirchhoff Index," Methodology and Computing in Applied Probability, Springer, vol. 6(4), pages 381-387, December.
  • Handle: RePEc:spr:metcap:v:6:y:2004:i:4:d:10.1023_b:mcap.0000045086.76839.54
    DOI: 10.1023/B:MCAP.0000045086.76839.54
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/B:MCAP.0000045086.76839.54
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/B:MCAP.0000045086.76839.54?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. He, Weihua & Li, Hao & Xiao, Shuofa, 2017. "On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 315(C), pages 313-318.
    2. Huang, Guixian & He, Weihua & Tan, Yuanyao, 2019. "Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness," Applied Mathematics and Computation, Elsevier, vol. 341(C), pages 348-357.

    More about this item

    Keywords

    effective resistance; geodetic graphs;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:metcap:v:6:y:2004:i:4:d:10.1023_b:mcap.0000045086.76839.54. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.