{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T23:08:19Z","timestamp":1775084899300,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T00:00:00Z","timestamp":1711670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Scientific Research Deanship, University of Hail","award":["RG-23 019"],"award-info":[{"award-number":["RG-23 019"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s40314-024-02647-0","type":"journal-article","created":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T15:01:46Z","timestamp":1711724506000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the graphs of a fixed cyclomatic number and order with minimum general sum-connectivity and Platt indices"],"prefix":"10.1007","volume":"43","author":[{"given":"Abeer M.","family":"Albalahi","sequence":"first","affiliation":[]},{"given":"Zhibin","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8160-4196","authenticated-orcid":false,"given":"Akbar","family":"Ali","sequence":"additional","affiliation":[]},{"given":"Abdulaziz M.","family":"Alanazi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,29]]},"reference":[{"key":"2647_CR1","doi-asserted-by":"publisher","first-page":"2150042","DOI":"10.1142\/S1793830921500427","volume":"13","author":"S Ahmed","year":"2021","unstructured":"Ahmed S (2021) On the maximum general sum-connectivity index of trees with a fixed order and maximum degree. Discr Math Algorith Appl 13:2150042","journal-title":"Discr Math Algorith Appl"},{"key":"2647_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.dam.2017.12.007","volume":"238","author":"A Ali","year":"2018","unstructured":"Ali A, Dimitrov D (2018) On the extremal graphs with respect to bond incident degree indices. Discr Appl Math 238:32\u201340","journal-title":"Discr Appl Math"},{"key":"2647_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.dam.2018.10.009","volume":"257","author":"A Ali","year":"2019","unstructured":"Ali A, Dimitrov D, Du Z, Ishfaq F (2019) On the extremal graphs for general sum-connectivity index ($$\\chi _{_\\alpha }$$) with given cyclomatic number when $$\\alpha > 1$$. Discr Appl Math 257:19\u201330","journal-title":"Discr Appl Math"},{"key":"2647_CR4","first-page":"97","volume":"5","author":"A Ali","year":"2020","unstructured":"Ali A, Javaid M, Mateji\u0107 M, Milovanovi\u0107 I, Milovanovi\u0107 E (2020) Some new bounds on the general sum-connectivity index. Commun Comb Optim 5:97\u2013109","journal-title":"Commun Comb Optim"},{"key":"2647_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph theory. Springer, London"},{"key":"2647_CR6","volume-title":"Graphs & digraphs","author":"G Chartrand","year":"2016","unstructured":"Chartrand G, Lesniak L, Zhang P (2016) Graphs & digraphs. CRC Press, Boca Raton"},{"key":"2647_CR7","volume":"443","author":"X Chen","year":"2023","unstructured":"Chen X (2023) General sum-connectivity index of a graph and its line graph. Appl Math Comput 443:127779","journal-title":"Appl Math Comput"},{"key":"2647_CR8","first-page":"31","volume":"25","author":"KC Das","year":"2003","unstructured":"Das KC (2003) Sharp bounds for the sum of the squares of the degrees of a graph. Kragujevac J Math 25:31\u201349","journal-title":"Kragujevac J Math"},{"key":"2647_CR9","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s10910-010-9702-6","volume":"48","author":"Z Du","year":"2010","unstructured":"Du Z, Zhou B, Trinajsti\u0107 N (2010) Minimum general sum-connectivity index of unicyclic graphs. J Math Chem 48:697\u2013703","journal-title":"J Math Chem"},{"key":"2647_CR10","first-page":"51","volume":"25","author":"I Gutman","year":"2003","unstructured":"Gutman I (2003) Graphs with smallest sum of squares of vertex degrees. Kragujevac J Math 25:51\u201354","journal-title":"Kragujevac J Math"},{"key":"2647_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.14445\/22315373\/IJMTT-V67I6P506","volume":"67","author":"I Gutman","year":"2021","unstructured":"Gutman I, Kulli VR, Red\u017eepovi\u0107 I (2021) Nirmala index of Kragujevac trees. Int J Math Trends Technol 67:44\u201349","journal-title":"Int J Math Trends Technol"},{"key":"2647_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.46793\/match.88-3.505H","volume":"88","author":"Z Hu","year":"2022","unstructured":"Hu Z, Li L, Li X, Peng D (2022) Extremal graphs for topological index defined by a degree-based edge-weight function. MATCH Commun Math Comput Chem 88:505\u2013520","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2647_CR13","first-page":"1","volume":"6","author":"R Kazemi","year":"2021","unstructured":"Kazemi R (2021) Gordon\u2013Scantlebury and Platt indices of random plane-oriented recursive trees. Math Interdis Res 6:1\u201310","journal-title":"Math Interdis Res"},{"key":"2647_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.47443\/dml.2021.s210","volume":"9","author":"X Li","year":"2022","unstructured":"Li X, Peng D (2022) Extremal problems for graphical function-indices and $$f$$-weighted adjacency matrix. Discr Math Lett 9:57\u201366","journal-title":"Discr Math Lett"},{"key":"2647_CR15","doi-asserted-by":"publisher","first-page":"653","DOI":"10.21136\/CMJ.2022.0089-21","volume":"72","author":"Y Lu","year":"2022","unstructured":"Lu Y, Zhou Q (2022) On hyper-Zagreb index conditions for Hamiltonicity of graphs. Czech Math J 72:653\u2013662","journal-title":"Czech Math J"},{"key":"2647_CR16","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1023\/B:MODI.0000047504.14261.2a","volume":"8","author":"A Mili\u010devi\u0107","year":"2004","unstructured":"Mili\u010devi\u0107 A, Nikoli\u0107 S, Trinajsti\u0107 N (2004) On reformulated Zagreb indices. Mol Divers 8:393\u2013399","journal-title":"Mol Divers"},{"key":"2647_CR17","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1021\/j150495a009","volume":"56","author":"JR Platt","year":"1952","unstructured":"Platt JR (1952) Prediction of isomeric differences in paraffin properties. J Phys Chem 56:328\u2013336","journal-title":"J Phys Chem"},{"key":"2647_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.47443\/ejm.2021.0014","volume":"1","author":"SD Stankov","year":"2021","unstructured":"Stankov SD, Mateji\u0107 MM, Milovanovi\u0107 I\u017d, Milovanovi\u0107 EI, Alt\u0131nda\u011f \u015eBB (2021) Some new bounds on the first Zagreb index. Electron J Math 1:101\u2013107","journal-title":"Electron J Math"},{"key":"2647_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.dam.2019.07.007","volume":"267","author":"I Tomescu","year":"2019","unstructured":"Tomescu I (2019) Proof of a conjecture concerning maximum general sum-connectivity index $$\\chi _\\alpha $$ of graphs with given cyclomatic number when $$1 < \\alpha < 2$$. Discr Appl Math 267:219\u2013223","journal-title":"Discr Appl Math"},{"key":"2647_CR20","volume-title":"Chemical graph theory","author":"N Trinajsti\u0107","year":"1992","unstructured":"Trinajsti\u0107 N (1992) Chemical graph theory. CRC Press, Boca Raton"},{"key":"2647_CR21","doi-asserted-by":"publisher","first-page":"2150140","DOI":"10.1142\/S1793830921501408","volume":"14","author":"T Vetr\u00edk","year":"2022","unstructured":"Vetr\u00edk T (2022) General sum-connectivity index of unicyclic graphs with given diameter and girth. Discr Math Algorith Appl 14:2150140","journal-title":"Discr Math Algorith Appl"},{"key":"2647_CR22","first-page":"227","volume":"12","author":"T Vetr\u00edk","year":"2023","unstructured":"Vetr\u00edk T (2023) General sum-connectivity index of trees with given number of branching vertices. Trans Combin 12:227\u2013238","journal-title":"Trans Combin"},{"key":"2647_CR23","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.dam.2023.02.018","volume":"333","author":"T Vetr\u00edk","year":"2023","unstructured":"Vetr\u00edk T (2023) Degree-based function index for graphs with given diameter. Discr Appl Math 333:59\u201370","journal-title":"Discr Appl Math"},{"key":"2647_CR24","doi-asserted-by":"publisher","DOI":"10.1201\/9780429450532","volume-title":"Introduction to chemical graph theory","author":"S Wagner","year":"2018","unstructured":"Wagner S, Wang H (2018) Introduction to chemical graph theory. CRC Press, Boca Raton"},{"key":"2647_CR25","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1007\/s10910-008-9515-z","volume":"46","author":"B Zhou","year":"2009","unstructured":"Zhou B, Trinajsti\u0107 N (2009) On a novel connectivity index. J Math Chem 46:1252\u20131270","journal-title":"J Math Chem"},{"key":"2647_CR26","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10910-009-9542-4","volume":"47","author":"B Zhou","year":"2010","unstructured":"Zhou B, Trinajsti\u0107 N (2010) On general sum-connectivity index. J Math Chem 47:210\u2013218","journal-title":"J Math Chem"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02647-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02647-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02647-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:20:57Z","timestamp":1712553657000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02647-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,29]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["2647"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02647-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,29]]},"assertion":[{"value":"22 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"137"}}