IDEAS home Printed from https://ideas.repec.org/a/hin/complx/3769831.html
   My bibliography  Save this article

Ordering Acyclic Connected Structures of Trees Having Greatest Degree-Based Invariants

Author

Listed:
  • S. Kanwal
  • M.K. Siddiqui
  • E. Bonyah
  • T. S. Shaikh
  • I. Irshad
  • S. Khalid
  • Keke Shang

Abstract

Being building block of data sciences, link prediction plays a vital role in revealing the hidden mechanisms that lead the networking dynamics. Since many techniques depending in vertex similarity and edge features were put forward to rule out many well-known link prediction challenges, many problems are still there just because of unique formulation characteristics of sparse networks. In this study, we applied some graph transformations and several inequalities to determine the greatest value of first and second Zagreb invariant, SK and SK1 invariants, for acyclic connected structures of given order, diameter, and pendant vertices. Also, we determined the corresponding extremal acyclic connected structures for these topological indices and provide an ordering (with 5 members) giving a sequence of acyclic connected structures having these indices from greatest in decreasing order.

Suggested Citation

  • S. Kanwal & M.K. Siddiqui & E. Bonyah & T. S. Shaikh & I. Irshad & S. Khalid & Keke Shang, 2022. "Ordering Acyclic Connected Structures of Trees Having Greatest Degree-Based Invariants," Complexity, Hindawi, vol. 2022, pages 1-16, March.
    • Handle: RePEc:hin:complx:3769831
    DOI: 10.1155/2022/3769831
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2022/3769831.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/complexity/2022/3769831.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/3769831?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:complx:3769831. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.