Shooshtari, HajarMotamedi, RuhollahCancan, Murat2025-05-102025-05-1020221793-55711793-718310.1142/S17935571225019722-s2.0-85141273126https://doi.org/10.1142/S1793557122501972https://hdl.handle.net/20.500.14720/14375The sum-connectivity index of a graph G is defined as the sum of weights 1/root d(w) +d(z ) over all edges wz of G, where d(w) and d(z) are the degrees of the vertices w and z in G, respectively. In this paper, we provide a simpler method to the extremal trees and unicyclic graph of the sum-connectivity index.eninfo:eu-repo/semantics/closedAccessSum-Connectivity IndexTreeUnicyclic GraphsArticle1511N/AQ3WOS:000849393000001