JOURNAL ARTICLE

Extremal results on the Mostar index of trees with fixed parameters.

  • Published In: Discrete Mathematics, Algorithms & Applications, 2025, v. 17, n. 2. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Hayat, Fazal; Xu, Shou-Jun 3 of 3

Abstract

For a graph G , the Mostar index of G is the sum of | n u (e) − n v (e) | over all edges e = u v of G , where n u (e) denotes the number of vertices of G that have a smaller distance in G to u than to v , and analogously for n v (e). We determine all the graphs that maximize and minimize the Mostar index, respectively, over all trees in terms of some fixed parameters like the number of odd vertices, the number of vertices of degree two, and the number of pendent paths of fixed length. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Discrete Mathematics, Algorithms & Applications. 2025/02, Vol. 17, Issue 2, p1
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2025
  • ISSN:1793-8309
  • DOI:10.1142/S1793830924500253
  • Accession Number:182482395
  • Copyright Statement:Copyright of Discrete Mathematics, Algorithms & Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.