Affiliation:
1. School of Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China
Abstract
Let G be a connected graph; the edge Mostar index Moe(G) of G is defined as Moe(G)=∑e=uv∈E(G)|mu(e)−mv(e)|, where mu(e) and mv(e) denote the number of edges in G that are closer to vertex u than to vertex v and the number of edges that are closer to vertex v than to vertex u, respectively. In this paper, we determine the upper bound of the edge Mostar index for all bicyclic graphs and identify the extremal graphs that achieve this bound.
Funder
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference19 articles.
1. Bondy, J.A., and Murty, U.S.R. (2008). Graph Theory, Springer.
2. Fifty Years of the Wiener Index;Gutman;MATCH Communications in Mathematical and in Computer Chemistry,1997
3. Some recent results in the theory of the Wiener number;Gutman;Indian J. Chem.,1993
4. Structural determination of paraffin boiling points;Wiener;J. Am. Chem. Soc.,1947
5. Wiener index of trees: Theory and applications;Dobrynin;Acta Appl. Math.,2001