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

On the extremal values for the Mostar index of trees with given degree sequence

Author

Listed:
  • Deng, Kecai
  • Li, Shuchao

Abstract

For a given graph G, the Mostar index Mo(G) is the sum of absolute values of the differences between nu(e) and nv(e) over all edges e=uv of G, where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to u than to v and the number of vertices of G lying closer to v than to u. The degree sequence of a tree is the sequence of the degrees (in descending order) of the non-leaf vertices. This paper determines those trees with a given degree sequence which have the greatest Mostar index. Consequently, all extremal trees with the greatest Mostar index are obtained in the sets of all trees of order n with the maximum degree, the number of leaves, the independence number and the matching number, respectively. On the other hand, some properties of trees with a given degree sequence which have the least Mostar index are given. We also determine those trees with exactly n−3 or n−4 leaves when the degree sequence is given, which have the least Mostar index. At last some numerical results are discussed, in which we calculate the Mostar indices of two sets of molecular graphs: octane isomers and benzenoid hydrocarbons; We compare their Mostar indices with some other distance-based topological indices through their correlations with the chemical properties. The linear model for the Mostar index is better than or as good as the models corresponding to the other distance-based indices.

Suggested Citation

  • Deng, Kecai & Li, Shuchao, 2021. "On the extremal values for the Mostar index of trees with given degree sequence," Applied Mathematics and Computation, Elsevier, vol. 390(C).
    • Handle: RePEc:eee:apmaco:v:390:y:2021:i:c:s0096300320305531
    DOI: 10.1016/j.amc.2020.125598
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320305531
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125598?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. Tepeh, Aleksandra, 2019. "Extremal bicyclic graphs with respect to Mostar index," Applied Mathematics and Computation, Elsevier, vol. 355(C), pages 319-324.
    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. Liu, Guorong & Deng, Kecai, 2023. "The maximum Mostar indices of unicyclic graphs with given diameter," Applied Mathematics and Computation, Elsevier, vol. 439(C).
    2. Li, Shuchao & Liu, Xin & Sun, Wanting & Yan, Lixia, 2023. "Extremal trees of a given degree sequence or segment sequence with respect to average Steiner 3-eccentricity," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    3. Buyantogtokh, Lkhagva & Azjargal, Enkhbayar & Horoldagva, Batmend & Dorjsembe, Shiikhar & Adiyanyam, Damchaa, 2021. "On the maximum size of stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 392(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. Buyantogtokh, Lkhagva & Azjargal, Enkhbayar & Horoldagva, Batmend & Dorjsembe, Shiikhar & Adiyanyam, Damchaa, 2021. "On the maximum size of stepwise irregular graphs," Applied Mathematics and Computation, Elsevier, vol. 392(C).
    2. Hui Wang & Mengmeng Liu, 2023. "The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs," Mathematics, MDPI, vol. 11(11), pages 1-8, May.
    3. Liu, Guorong & Deng, Kecai, 2023. "The maximum Mostar indices of unicyclic graphs with given diameter," Applied Mathematics and Computation, Elsevier, vol. 439(C).
    4. Ali, Akbar & Došlić, Tomislav, 2021. "Mostar index: Results and perspectives," Applied Mathematics and Computation, Elsevier, vol. 404(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:390:y:2021:i:c:s0096300320305531. 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.