On extremal cacti with respect to the revised Szeged index

摘要: Abstract The revised Szeged index of a graph G is defined as S z ∗ ( ) = ∑ e u v ∈ E n + 0 2 , where and are, respectively, the number vertices lying closer to vertex than equidistant . A cactus in which any two cycles have at most one common vertex. Let C k denote class all cacti with cycles. In this paper, sharp lower bound on established corresponding extremal determined. Furthermore, second minimal identified well.