On tricyclic graphs with maximum edge Mostar index

MaRDI QIDQ6443218zbMATH OpenFDO

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

Publication date 10 July 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 the sharp upper bound for the edge Mostar index on tricyclic graphs with a fixed number of edges, and the graphs that attain the bound are completely characterized.

This page was built for publication: On tricyclic 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 Q6443218)