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

The extremal graphs of order trees and their topological indices

Author

Listed:
  • Song, Rui
  • Huang, Qiongxiang
  • Wang, Peng

Abstract

Recently, D. Vukičević and J. Sedlar in [1] introduced an order “⪯” on Tn, the set of trees on n vertices, such that the topological index F of a graph is a function defined on the order set 〈Tn,⪯〉. It provides a new approach to determine the extremal graphs with respect to topological index F. By using the method they determined the common maximum and/or minimum graphs of Tn with respect to topological indices of Wiener type and anti-Wiener type. Motivated by their researches we further study the order set 〈Tn,⪯〉 and give a criterion to determine its order, which enable us to get the common extremal graphs in four prescribed subclasses of 〈Tn,⪯〉. All these extremal graphs are confirmed to be the common maximum and/or minimum graphs with respect to the topological indices of Wiener type and anti-Wiener type. Additionally, we calculate the exact values of Wiener index for the extremal graphs in the order sets 〈C(n,k),⪯〉,〈Tn(q),⪯〉 and 〈TnΔ,⪯〉.

Suggested Citation

  • Song, Rui & Huang, Qiongxiang & Wang, Peng, 2021. "The extremal graphs of order trees and their topological indices," Applied Mathematics and Computation, Elsevier, vol. 398(C).
  • Handle: RePEc:eee:apmaco:v:398:y:2021:i:c:s0096300321000369
    DOI: 10.1016/j.amc.2021.125988
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300321000369
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2021.125988?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:398:y:2021:i:c:s0096300321000369. 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.