The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Mathematics · 30.05.2023 · 11 (11) · 2506
DOI: 10.3390/math11112506 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 30.05.2023. Verfasst von Hui Wang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 19 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
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.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Wang, H., & Liu, M. (2023). The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs. Mathematics, 11(11), 2506. https://doi.org/10.3390/math11112506
Vancouver
Wang H, Liu M. The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs. Mathematics. 2023;11(11):2506. doi:10.3390/math11112506
BibTeX
@article{Wang2023,
author = {Wang, Hui and Liu, Mengmeng},
title = {The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs},
journal = {Mathematics},
year = {2023},
volume = {11},
number = {11},
pages = {2506},
doi = {10.3390/math11112506}
}
EUVIMED