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

Extremal pentagonal chains with respect to the Kirchhoff index

Author

Listed:
  • Sun, Wensheng
  • Yang, Yujun

Abstract

The resistance distance between any two vertices of a connected graph G is defined as the effective resistance between them in the electrical network constructed from G by replacing each edge of G with a unit resistor. The Kirchhoff index is a resistance distance-based topological index which plays an essential role in the study of quantitative structure-activity relationship (QSAR) and quantitative structure-property relationship (QSPR). In this paper, using techniques from electric network theory and graph theory, we characterize pentagonal chains with extermal Kirchhoff indices.

Suggested Citation

  • Sun, Wensheng & Yang, Yujun, 2023. "Extremal pentagonal chains with respect to the Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 437(C).
    • Handle: RePEc:eee:apmaco:v:437:y:2023:i:c:s0096300322006087
    DOI: 10.1016/j.amc.2022.127534
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Yongsheng Rao & Adnan Aslam & Muhammad Unfowan Noor & A. Othman Almatroud & Zehui Shao, 2020. "Bond Incident Degree Indices of Catacondensed Pentagonal Systems," Complexity, Hindawi, vol. 2020, pages 1-7, August.
    2. Sardar, Muhammad Shoaib & Pan, Xiang-Feng & Xu, Si-Ao, 2020. "Computation of resistance distance and Kirchhoff index of the two classes of silicate networks," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    3. Li, Zhemin & Xie, Zheng & Li, Jianping & Pan, Yingui, 2020. "Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star," Applied Mathematics and Computation, Elsevier, vol. 382(C).
    4. 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.
    5. Chen, Wuxian & Yan, Weigen, 2021. "Resistance distances in vertex-weighted complete multipartite graphs," Applied Mathematics and Computation, Elsevier, vol. 409(C).
    6. Palacios, José Luis & Markowsky, Greg, 2021. "Kemeny’s constant and the Kirchhoff index for the cluster of highly symmetric graphs," Applied Mathematics and Computation, Elsevier, vol. 406(C).
    7. Yang, Yujun & Cao, Yuliang & Yao, Haiyuan & Li, Jing, 2018. "Solution to a conjecture on a Nordhaus–Gaddum type result for the Kirchhoff index," Applied Mathematics and Computation, Elsevier, vol. 332(C), pages 241-249.
    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.
    1. Sardar, Muhammad Shoaib & Pan, Xiang-Feng & Xu, Si-Ao, 2020. "Computation of resistance distance and Kirchhoff index of the two classes of silicate networks," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    2. Abeer M. Albalahi & Akbar Ali & Zhibin Du & Akhlaq Ahmad Bhatti & Tariq Alraqad & Naveed Iqbal & Amjad E. Hamza, 2022. "On Bond Incident Degree Indices of Chemical Graphs," Mathematics, MDPI, vol. 11(1), pages 1-13, December.
    3. Lin, Wei & Li, Min & Zhou, Shuming & Liu, Jiafei & Chen, Gaolin & Zhou, Qianru, 2021. "Phase transition in spectral clustering based on resistance matrix," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 566(C).
    4. Sajjad, Wasim & Sardar, Muhammad Shoaib & Pan, Xiang-Feng, 2024. "Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron," Applied Mathematics and Computation, Elsevier, vol. 461(C).
    5. 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.

    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:437:y:2023:i:c:s0096300322006087. 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: 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.