On the Mostar index of trees and product graphs-Reference-Cited by-同舟云学术

On the Mostar index of trees and product graphs

Published:2021 Issue:14 Volume:35 Page:4637-4643
ISSN:0354-5180
Container-title:Filomat
language:en
Short-container-title:Filomat

Author:

Alizadeh Yaser¹,Xu Kexiang²,Klavzar Sandi³

Affiliation:

1. Department of Mathematics, Hakim Sabzevari University, Sabzevar, Iran

2. College of Science, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, PR China

3. Faculty of Mathematics and Physics, University of Ljubljana, Slovenia + Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia + Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia

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.

Publisher

National Library of Serbia

Subject

General Mathematics

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mostar index and bounded maximum degree;Discrete Optimization;2024-11

2. Extremal results on the Mostar index of trees with fixed parameters;Discrete Mathematics, Algorithms and Applications;2024-03-29

3. Bounding the Mostar index;Discrete Mathematics;2024-01

4. Maximizing the Mostar index for bipartite graphs and split graphs;Discrete Optimization;2023-05

5. THE MOSTAR AND WIENER INDEX OF ALTERNATE LUCAS CUBES;TRANS COMB;2023