Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
