The maximum Mostar indices of unicyclic graphs with given diameter

Guorong Liu and Kecai Deng

Applied Mathematics and Computation, 2023, vol. 439, issue C

Abstract: For an edge e=uv in a given graph G, let nGu(e) be the number of vertices which have a less distance from u than that from v. Then |nGu(e)−nGv(e)| is called the contribution of e. The Mostar index is defined as the sum of the edge contributions in G. In this paper, the unicyclic graphs with order n and diameter d, having the greatest Mostar index are determined.

Keywords: Mostar index; Unicyclic graph; Diameter (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322007081
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:439:y:2023:i:c:s0096300322007081

DOI: 10.1016/j.amc.2022.127636

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().