Ordering Acyclic Connected Structures of Trees Having Greatest Degree-Based Invariants. (16th March 2022)

• Record Type: Journal Article
• Authors: Kanwal, S.; Siddiqui, M.K.; Bonyah, E.; Shaikh, T. S.; Irshad, I.; Khalid, S.
• Other Names: Shang Keke Academic Editor.
• Is Part Of: Complexity. Volume 2022(2022)
• Publication Date: 2022-03-16
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2022/3769831
• Languages: English
• ISSNs: 1076-2787

Abstract

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, S K and S K 1 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.