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

On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves

Author

Listed:
  • Du, Jianwei
  • Sun, Xiaoling

Abstract

A tree in which no vertex has a degree greater than 4 is called a chemical tree. The bond incident degree index of a chemical tree T is defined as ∑xy∈ETφ(degT(x),degT(y)), where ET is the edge set of T, φ is a real-valued symmetric function, and degT(x) stands for the degree of a vertex x of T. This paper reports extremal results on bond incident degree indices of chemical trees with a fixed order and a fixed number of leaves. Furthermore, we use these results directly to some renowned topological indices, such as symmetric division deg index, Randić index, geometric-arithmetic index, sum-connectivity index, Sombor index, harmonic index, multiplicative sum Zagreb index, atom-bond connectivity index, etc.

Suggested Citation

  • Du, Jianwei & Sun, Xiaoling, 2024. "On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves," Applied Mathematics and Computation, Elsevier, vol. 464(C).
    • Handle: RePEc:eee:apmaco:v:464:y:2024:i:c:s0096300323005593
    DOI: 10.1016/j.amc.2023.128390
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323005593
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128390?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. Du, Jianwei & Sun, Xiaoling, 2022. "Extremal symmetric division deg index of molecular trees and molecular graphs with fixed number of pendant vertices," Applied Mathematics and Computation, Elsevier, vol. 434(C).
    2. Cruz, Roberto & Monsalve, Juan & Rada, Juan, 2020. "Extremal values of vertex-degree-based topological indices of chemical trees," Applied Mathematics and Computation, Elsevier, vol. 380(C).
    3. Dimitrov, Darko & Du, Zhibin, 2021. "A solution of the conjecture about big vertices of minimal-ABC trees," Applied Mathematics and Computation, Elsevier, vol. 397(C).
    4. Vujošević, Saša & Popivoda, Goran & Kovijanić Vukićević, Žana & Furtula, Boris & Škrekovski, Riste, 2021. "Arithmetic–geometric index and its relations with geometric–arithmetic index," Applied Mathematics and Computation, Elsevier, vol. 391(C).
    5. Chen, Xiaohong, 2023. "General sum-connectivity index of a graph and its line graph," Applied Mathematics and Computation, Elsevier, vol. 443(C).
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Das, Kinkar Chandra, 2024. "Open problems on Sombor index of unicyclic and bicyclic graphs," Applied Mathematics and Computation, Elsevier, vol. 473(C).

    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. Gao, Wei & Gao, Yubin, 2024. "The extremal trees for exponential vertex-degree-based topological indices," Applied Mathematics and Computation, Elsevier, vol. 472(C).
    2. Li, Shuchao & Wang, Zheng & Zhang, Minjie, 2022. "On the extremal Sombor index of trees with a given diameter," Applied Mathematics and Computation, Elsevier, vol. 416(C).
    3. Cruz, Roberto & Gutman, Ivan & Rada, Juan, 2021. "Sombor index of chemical graphs," Applied Mathematics and Computation, Elsevier, vol. 399(C).

    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:464:y:2024:i:c:s0096300323005593. 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.