Azarbaijan Shahid Madani University Communications in Combinatorics and Optimization 2538-2128 11 1 2026 03 01 Sharp bounds on additively weighted Mostar index of cacti 117 130 14759 10.22049/cco.2024.28757.1702 EN Liju Alex Department of Mathematics,Bishop Chulaparambil Memorial College, Kottayam-686001, India Department of Mathematics, Marthoma College, Tiruvalla - 689103, India G. Indulal Department of Mathematics, St. Aloysius College, Edathua, Alappuzha - 689573, India Journal Article 2023 06 16 Let C(n, t) denotes the collection of all cacti of order n with exactly t cycles and Ctn<br /><br />denotes 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. https://comb-opt.azaruniv.ac.ir/article_14759_d9e7bd89803f5cc3db7b689b00e8c8f1.pdf