sharp bounds on additively weighted mostar index of cacti

Let c(n, t) denotes the collection of all cacti of order n with exactly t cycles and ctndenotes the cacti of order n and t end vertices. in this paper, we compute the upper bound, second largest upper bound, and third largest upper bound of the additively weighted mostar index of graphs in c(n, t). we also determine the upper bound of the additively weighted mostar index for cacti of order n with a fixed number of end vertices. we characterize all the graphs attaining the bounds.