{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:20:56Z","timestamp":1753885256376,"version":"3.41.2"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p> The sum-connectivity index of a graph [Formula: see text] is defined as the sum of weights [Formula: see text] over all edges [Formula: see text] of [Formula: see text], where [Formula: see text] and [Formula: see text] are the degrees of the vertices [Formula: see text] and [Formula: see text] in [Formula: see text], respectively. In this paper, some extremal problems on the sum-connectivity index of trees are studied. The extremal values on the sum-connectivity index of trees with given graphic parameters, such as pendant number, matching number, domination number and diameter, are determined. The corresponding extremal graphs are characterized, respectively. <\/jats:p>","DOI":"10.1142\/s1793830921501536","type":"journal-article","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T11:13:07Z","timestamp":1625569987000},"source":"Crossref","is-referenced-by-count":0,"title":["Sharp lower bounds on the sum-connectivity index of trees"],"prefix":"10.1142","volume":"14","author":[{"given":"S.","family":"Alyar","sequence":"first","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]},{"given":"R.","family":"Khoeilar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"}]}],"member":"219","published-online":{"date-parts":[[2021,7,5]]},"reference":[{"key":"S1793830921501536BIB001","first-page":"97","volume":"5","author":"Ali A.","year":"2020","journal-title":"Commun. Comb. Optim."},{"key":"S1793830921501536BIB002","first-page":"250","volume":"21","author":"Alyar S.","year":"2021","journal-title":"Appl. Math. E-Notes"},{"key":"S1793830921501536BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90127-4"},{"key":"S1793830921501536BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s10910-009-9604-7"},{"key":"S1793830921501536BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.05.023"},{"key":"S1793830921501536BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(01)00465-7"},{"key":"S1793830921501536BIB007","first-page":"101","volume-title":"Novel Molecular Structure Descriptors \u2014 Theory and Applications I","author":"Lu\u010di\u0107 B.","year":"2010"},{"key":"S1793830921501536BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.cplett.2009.05.022"},{"key":"S1793830921501536BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.008"},{"key":"S1793830921501536BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s10910-008-9515-z"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921501536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T04:50:40Z","timestamp":1659415840000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830921501536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,5]]},"references-count":10,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1142\/S1793830921501536"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921501536","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2021,7,5]]},"article-number":"2150153"}}