IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v473y2024ics0096300324001425.html
   My bibliography  Save this article

Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs

Author

Listed:
  • Sardar, Muhammad Shoaib
  • Pan, Xiang-Feng
  • Xu, Shou-Jun

Abstract

Let G be a simple connected graph with vertex set V(G) and edge set E(G). The resistance distance r(u,v) between two vertices u,v∈V(G) is the net effective resistance between them in the electric network constructed from G by replacing each edge with a unit resistor. This function is known to be a metric on the vertex-set of any graph. The sum of resistance distances between pairs of vertices in a G is called Kirchhoff index and is denoted by Kf(G). In this study, we will compute the resistance distance between pairs of vertices of string of diamonds and ring of diamonds by using some methods from electrical network theory such as series and parallel principles, the principle of elimination, the star-triangle transformation, and the delta-wye transformation. Then we determine the exact formulas for the Kirchhoff index of the string of diamonds and ring of diamonds.

Suggested Citation

  • Sardar, Muhammad Shoaib & Pan, Xiang-Feng & Xu, Shou-Jun, 2024. "Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs," Applied Mathematics and Computation, Elsevier, vol. 473(C).
    • Handle: RePEc:eee:apmaco:v:473:y:2024:i:c:s0096300324001425
    DOI: 10.1016/j.amc.2024.128670
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300324001425
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2024.128670?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.

    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:eee:apmaco:v:473:y:2024:i:c:s0096300324001425. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.