{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:15:52Z","timestamp":1758824152758},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:p> For a simple graph [Formula: see text], the general sum-connectivity index is defined as [Formula: see text], where [Formula: see text] is the degree of the vertex [Formula: see text] and [Formula: see text] is a real number. In this paper, we will obtain sharp upper bounds on the general sum-connectivity index for [Formula: see text]. Moreover, the two trees with the maximum and the second maximum the general sum-connectivity index, respectively, are determined. <\/jats:p>","DOI":"10.1142\/s1793830921500257","type":"journal-article","created":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T05:38:20Z","timestamp":1603517900000},"page":"2150025","source":"Crossref","is-referenced-by-count":2,"title":["Two-tree graphs with maximum general sum-connectivity index"],"prefix":"10.1142","volume":"13","author":[{"given":"R.","family":"Khoeilar","sequence":"first","affiliation":[{"name":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran"}]},{"given":"H.","family":"Shooshtari","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Esfahan University of Technology, Esfahan, Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,10,24]]},"reference":[{"key":"S1793830921500257BIB001","first-page":"97","volume":"5","author":"Ali A.","year":"2020","journal-title":"Commun. Comb. Optim."},{"key":"S1793830921500257BIB002","first-page":"93","volume":"19","author":"Arshad M.","year":"2017","journal-title":"Math. Rep."},{"key":"S1793830921500257BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(72)85099-1"},{"key":"S1793830921500257BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.01.020"},{"key":"S1793830921500257BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.01.016"},{"key":"S1793830921500257BIB006","doi-asserted-by":"publisher","DOI":"10.7153\/jmi-2019-13-32"},{"key":"S1793830921500257BIB007","first-page":"715","volume":"72","author":"Tomescu I.","year":"2014","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"S1793830921500257BIB008","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/90\/68002"},{"key":"S1793830921500257BIB009","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.016116"},{"key":"S1793830921500257BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2005.08.020"},{"key":"S1793830921500257BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2012.01.039"},{"key":"S1793830921500257BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s10910-009-9542-4"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T07:28:08Z","timestamp":1619594888000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,24]]},"references-count":12,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["10.1142\/S1793830921500257"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500257","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,24]]}}}