IDEAS home Printed from https://ideas.repec.org/a/wly/complx/v2022y2022i1n3769831.html

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

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, 2022. "Ordering Acyclic Connected Structures of Trees Having Greatest Degree‐Based Invariants," Complexity, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:complx:v:2022:y:2022:i:1:n:3769831
    DOI: 10.1155/2022/3769831
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/3769831
    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
    ---><---

    References listed on IDEAS

    as
    1. V. S. Shigehalli & Rachanna Kanabur, 2016. "Computation of New Degree-Based Topological Indices of Graphene," Journal of Mathematics, Hindawi, vol. 2016, pages 1-6, September.
    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. 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).
    2. Sourav Mondal & Nilanjan De & Anita Pal, 2019. "On Some New Neighborhood Degree-Based Indices for Some Oxide and Silicate Networks," J, MDPI, vol. 2(3), pages 1-26, August.
    3. A. Khalid & N. Kausar & M. Munir & M. Gulistan & M. M. Al-Shamiri & T. Lamoudan, 2022. "Topological Indices of Families of Bistar and Corona Product of Graphs," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    4. Ali Ahmad & Kashif Elahi & Muhammad Azeem & Senesie Swaray & Muhammad Ahsan Asim, 2022. "Topological Descriptors for the Metal Organic Network and Its Structural Properties," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    5. Kinkar Chandra Das & Jayanta Bera, 2025. "Resolving an Open Problem on the Exponential Arithmetic–Geometric Index of Unicyclic Graphs," Mathematics, MDPI, vol. 13(9), pages 1-11, April.
    6. Muhammad Haroon Aftab & Imran Siddique & Joshua Kiddy K. Asamoah & Hamiden Abd El-Wahed Khalifa & Muhammad Hussain, 2022. "Multiplicative Attributes Derived from Graph Invariants for Saztec4 Diamond," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).

    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:wly:complx:v:2022:y:2022:i:1:n: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.

    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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/8503 .

    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.