Open AccessOn the Mostar index of trees and product graphs
Author(s) -
Yaser Alizadeh,
Kexiang Xu,
Sandi Klavžar
Publication year - 2021
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil2114637a
Subject(s) - mathematics , combinatorics , cartesian product , graph , index (typography) , world wide web , computer science
If G is a graph, and if for e = uv ? E(G) the number of vertices closer to u than to v is denoted by nu, then Mo(G) = ? uv?E(G) |nu-nv| is the Mostar index of G. In this paper, the Mostar index is studied on trees and graph products. Lower and upper bounds are given on the difference between the Mostar indices of a tree and a tree obtained by contraction one of its edges and the corresponding extremal trees are characterized. An upper bound on the Mostar index for the class of all trees but the stars is proved. Extremal trees are also determined on the (k+1)-th largest/smallest Mostar index. The index is also studied on Cartesian and corona products.