For a simple connected graph G=(V,E), X(G)= is its sum-connectivity index, where du denotes the degree of a vertex u. A connected graph G is a cactus if any two of its cycles have at most one common vertex. Let G(n,r) be the set of cacti of order n and with r cycles, ζ(2n,r) the set of cacti of order 2n with a perfect matching and r cycles. In this paper, we give the sharp lower bounds of the sum-connectivity index of cacti among G(n,r) and ζ(2n,r) respectively: (1) if G∈G(n,r), n≥5, then X(G)≥ (2) if G∈ζ(2n,r), n≥4, then X(G)≥ and characterize the corresponding extremal cacti. © 2011 Elsevier Ltd.
Ma, F., & Deng, H. (2011). On the sum-connectivity index of cacti. Mathematical and Computer Modelling, 54(1–2), 497–507. https://doi.org/10.1016/j.mcm.2011.02.040