Edge Mostar Indices of Cacti Graph With Fixed Cycles

Abstract
Topological invariants are the significant invariants that are used to study the physicochemical and thermodynamic characteristics of chemical compounds. Recently, a new bond additive invariant named the Mostar invariant has been introduced. For any connected graph , the edge Mostar invariant is described as Moe()=gxE()|m(g)m(x)|, where m(g)(or m(x)) is the number of edges of lying closer to vertex g (or x) than to vertex x (or g). A graph having at most one common vertex between any two cycles is called a cactus graph. In this study, we compute the greatest edge Mostar invariant for cacti graphs with a fixed number of cycles and n vertices. Moreover, we calculate the sharp upper bound of the edge Mostar invariant for cacti graphs in (n,s), where s is the number of cycles.

This publication has 33 references indexed in Scilit: