{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T16:14:51Z","timestamp":1769184891559,"version":"3.49.0"},"reference-count":22,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:00:00Z","timestamp":1647388800000},"content-version":"vor","delay-in-days":74,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p>\n                    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\u2010known 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,\n                    <jats:italic>S<\/jats:italic>\n                    <jats:italic>K<\/jats:italic>\n                    and\n                    <jats:italic>S<\/jats:italic>\n                    <jats:italic>K<\/jats:italic>\n                    <jats:sub>1<\/jats:sub>\n                    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.\n                  <\/jats:p>","DOI":"10.1155\/2022\/3769831","type":"journal-article","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T18:20:14Z","timestamp":1647454814000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ordering Acyclic Connected Structures of Trees Having Greatest Degree\u2010Based Invariants"],"prefix":"10.1155","volume":"2022","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7560-5317","authenticated-orcid":false,"given":"S.","family":"Kanwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.K.","family":"Siddiqui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8763-6164","authenticated-orcid":false,"given":"E.","family":"Bonyah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. S.","family":"Shaikh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Irshad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Khalid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"e_1_2_8_1_2","first-page":"25","volume-title":"Topological Indices and Related Descriptors in QSAR and QSPR","author":"Devillers J.","year":"1999"},{"key":"e_1_2_8_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"e_1_2_8_3_2","first-page":"225","article-title":"Graphs of extremal weights","volume":"50","author":"Bollo\u00e1s B.","year":"1998","journal-title":"Ars Combinatoria"},{"key":"e_1_2_8_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10910-009-9542-4"},{"key":"e_1_2_8_5_2","doi-asserted-by":"publisher","DOI":"10.1021\/ja00856a001"},{"key":"e_1_2_8_6_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:MODI.0000047504.14261.2a"},{"key":"e_1_2_8_7_2","first-page":"5005","article-title":"Some bounds of reformulated Zagreb indices","volume":"6","author":"De N.","year":"2012","journal-title":"Applied Mathematical Sciences"},{"key":"e_1_2_8_8_2","first-page":"723","article-title":"On reformulated Zagreb indices with respect to acyclic, unicyclic and bicyclic graphs","volume":"72","author":"Ji S.","year":"2014","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"e_1_2_8_9_2","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/4341919"},{"key":"e_1_2_8_10_2","first-page":"257","article-title":"Trees, unicyclic, and bicyclic graphs extremal with respect to multiplicative sum Zagreb index","volume":"68","author":"Xu K.","year":"2012","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"e_1_2_8_11_2","first-page":"213","article-title":"The hyper Zagreb index of graph operations","volume":"4","author":"Shirdel G. H.","year":"2013","journal-title":"The International Journal of Management Cases"},{"key":"e_1_2_8_12_2","first-page":"66","article-title":"Sharp bounds of the hyper- Zagreb index on acyclic, unicyclic and bicyclic graphs","volume":"25","author":"Gao W.","year":"2017","journal-title":"Discrete Dynamics in Nature and Society"},{"key":"e_1_2_8_13_2","doi-asserted-by":"publisher","DOI":"10.3233\/jifs-181452"},{"key":"e_1_2_8_14_2","doi-asserted-by":"publisher","DOI":"10.1063\/5.0007422"},{"key":"e_1_2_8_15_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.5107440"},{"key":"e_1_2_8_16_2","first-page":"17","article-title":"Bounds for Zagreb indices","volume":"78","author":"Borovicanin B.","year":"2017","journal-title":"MATCH Commun. Math. Comput. Chem"},{"key":"e_1_2_8_17_2","first-page":"513","article-title":"On the extremal Zagreb indices of n-vertex chemical trees with fixed number of segments or branching vertices","volume":"84","author":"Noureen S.","year":"2020","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"e_1_2_8_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"e_1_2_8_19_2","volume-title":"Dynamical Systems: Examples of Complex Behaviour","author":"Jost J.","year":"2005"},{"key":"e_1_2_8_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcsi.2005.854604"},{"key":"e_1_2_8_21_2","first-page":"535","article-title":"Ordering trees having small general sum- connectivity index","volume":"69","author":"Tomescu I.","year":"2013","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"e_1_2_8_22_2","first-page":"65","article-title":"Sum of powers of the degrees of graphs: extremal results and bounds","volume":"80","author":"Ali A.","year":"2018","journal-title":"MATCH Commun. Math. Comput. Chem"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/3769831","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1155\/2022\/3769831","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2022\/3769831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:04:29Z","timestamp":1769115869000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2022\/3769831"}},"subtitle":[],"editor":[{"given":"Keke","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1155\/2022\/3769831"],"URL":"https:\/\/doi.org\/10.1155\/2022\/3769831","archive":["Portico"],"relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"value":"1076-2787","type":"print"},{"value":"1099-0526","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1]]},"assertion":[{"value":"2022-01-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"3769831"}}