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

Complexity 2022:1-16 (2022)
  Copy   BIBTEX

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 giving a sequence of acyclic connected structures having these indices from greatest in decreasing order.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Index sets for some classes of structures.Ekaterina B. Fokina - 2009 - Annals of Pure and Applied Logic 157 (2-3):139-147.
A Pigeonhole Property for Relational Structures.Anthony Bonato & Dejan Delić - 1999 - Mathematical Logic Quarterly 45 (3):409-413.

Analytics

Added to PP
2022-04-10

Downloads
13 (#1,040,422)

6 months
7 (#592,566)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Muhammad Siddiqui
York University
Saiqah Kanwal
University of Bradford
1 more

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references