Sharp Lower Bounds of the Sum-Connectivity Index of Unicyclic Graphs

The sum-connectivity index of a graph is defined as the sum of weights over all edges of , where and are the degrees of the vertices and in graph , respectively. In this paper, we give a sharp lower bound on the sum-connectivity index unicyclic graphs of order and diameter .