On the Extremal Weighted Mostar Index of Bicyclic Graphs

Let G be a simple connected graph with edge set E(G) and vertex set V(G). The weighted Mostar index of a graph G is defined as w+Mo(G)=∑e=uv∈E(G)(dG(u)+dG(v))|nu(e)−nv(e)|, where nu(e) denotes the number of vertices closer to u than to v for an edge uv in G. In this paper, we obtain the upper bound and lower bound of the weighted Mostar index among all bicyclic graphs and characterize the corresponding extremal graphs.