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

On connected graphs and trees with maximal inverse sum indeg index

Author

Listed:
  • Chen, Xiaodan
  • Li, Xiuyu
  • Lin, Wenshui

Abstract

Let G=(V,E) be a graph. The inverse sum indeg index (ISI index in short) of G is defined as ISI(G)=∑vivj∈Edidj/(di+dj), where di is the degree of vertex vi. This recently developed topological index can predict total surface area for octane isomers. It is known that the star Sn uniquely minimizes the ISI index among n-vertex trees. However, characterizing n-vertex tree(s) with maximal ISI index (optimal trees, for convenience) appears to be difficult. There are even no sound conjectures on their structure up to now.

Suggested Citation

  • Chen, Xiaodan & Li, Xiuyu & Lin, Wenshui, 2021. "On connected graphs and trees with maximal inverse sum indeg index," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    • Handle: RePEc:eee:apmaco:v:392:y:2021:i:c:s0096300320306846
    DOI: 10.1016/j.amc.2020.125731
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320306846
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125731?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. Lin, Wenshui & Chen, Jianfeng & Wu, Zhixi & Dimitrov, Darko & Huang, Linshan, 2018. "Computer search for large trees with minimal ABC index," Applied Mathematics and Computation, Elsevier, vol. 338(C), pages 221-230.
    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. 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).
    2. Yu Yang & Long Li & Wenhu Wang & Hua Wang, 2020. "On BC-Subtrees in Multi-Fan and Multi-Wheel Graphs," Mathematics, MDPI, vol. 9(1), pages 1-29, December.

    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:392:y:2021:i:c:s0096300320306846. 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.