Disproof of a Conjecture on the Edge Mostar Index
Utilitas Mathematica · 2024
DOI: 10.61091/um121-03 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, 2024. Verfasst von Fazal Hayat und 2 weiteren Autor:innen.
Abstract (Originalsprache)
For a connected graph \(G\), the edge Mostar index \(Mo_e(G)\) is defined as \(Mo_e(G)=\sum\limits_{e=uv \in E(G)}|m_u(e|G) - m_v(e|G)|\), where \(m_u(e|G)\) and \(m_v(e|G)\) are respectively, the number of edges of \(G\) lying closer to vertex \(u\) than to vertex \(v\) and the number of edges of \(G\) lying closer to vertex \(v\) than to vertex \(u\). We determine a sharp upper bound for the edge Mostar index on bicyclic graphs and identify the graphs that achieve the bound, which disproves a conjecture proposed by Liu et al. [Iranian J. Math. Chem. 11(2) (2020) 95--106].
Zitieren
APA
Hayat, F., Xu, S., & Zhou, B. (2024). Disproof of a Conjecture on the Edge Mostar Index. Utilitas Mathematica. https://doi.org/10.61091/um121-03
Vancouver
Hayat F, Xu S, Zhou B. Disproof of a Conjecture on the Edge Mostar Index. Utilitas Mathematica. 2024. doi:10.61091/um121-03
BibTeX
@article{Hayat2024,
author = {Hayat, Fazal and Xu, Shou-Jun and Zhou, Bo},
title = {Disproof of a Conjecture on the Edge Mostar Index},
journal = {Utilitas Mathematica},
year = {2024},
doi = {10.61091/um121-03}
}
EUVIMED