IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2014y2014i1n794781.html

Some Bounds for the Kirchhoff Index of Graphs

Author

Listed:
  • Yujun Yang

Abstract

The resistance distance between two vertices of a connected graph G is defined as the effective resistance between them in the corresponding electrical network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index of G is the sum of resistance distances between all pairs of vertices. In this paper, general bounds for the Kirchhoff index are given via the independence number and the clique number, respectively. Moreover, lower and upper bounds for the Kirchhoff index of planar graphs and fullerene graphs are investigated.

Suggested Citation

  • Yujun Yang, 2014. "Some Bounds for the Kirchhoff Index of Graphs," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).
    • Handle: RePEc:wly:jnlaaa:v:2014:y:2014:i:1:n:794781
    DOI: 10.1155/2014/794781
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2014/794781
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/794781?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
    ---><---

    References listed on IDEAS

    as
    1. Yujun Yang, 2012. "Bounds for the Kirchhoff Index of Bipartite Graphs," Journal of Applied Mathematics, Hindawi, vol. 2012, pages 1-9, April.
    2. Yujun Yang, 2012. "Bounds for the Kirchhoff Index of Bipartite Graphs," Journal of Applied Mathematics, John Wiley & Sons, vol. 2012(1).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      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:wly:jnlaaa:v:2014:y:2014:i:1:n:794781. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4058 .

      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.