On bicyclic graphs with maximum edge Mostar index

MaRDI QIDQ6439223zbMATH OpenFDO

Authors Fazal Hayat, S. J. Xu, Bo Zhou

Publication date 5 June 2023

Abstract: For a given connected graph $G$, the edge Mostar index $M{o}_e(G)$ is defined as $M{o}_e(G)=su{m}_{e=uvinE(G)}|m_u(e|G)-m_v(e|G)|$, where $m_u(e|G)$ and $m_v(e|G)$ are respectively, the number of edges of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of edges of $G$ lying closer to vertex $v$ than to vertex $u$. In this paper, we determine sharp upper bound for edge Mostar index on bicyclic graphs with fixed number of edges, also the graphs that achieve the bound are completely characterized, and thus disprove a conjecture on the edge Mostar index of bicyclic graph in [H. Liu, L. Song, Q. Xiao, Z. Tang, On edge Mostar index of graphs. Iranian J. Math. Chem. 11(2) (2020) 95--106].

This page was built for publication: On bicyclic graphs with maximum edge Mostar index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439223)