Extremal bicyclic graphs with respect to Mostar index

Aleksandra Tepeh

Applied Mathematics and Computation, 2019, vol. 355, issue C, 319-324

Abstract: For an edge uv of a graph G, nu denotes the number of vertices of G closer to u than to v, and similarly nv is the number of vertices closer to v than to u. The Mostar index of a graph G is defined as the sum of absolute differences between nu and nv over all edges uv of G. In the paper we prove a recent conjecture of Došlić et al. (2018) on a characterization of bicyclic graphs with given number of vertices, for which extremal values of Mostar index are attained.

Keywords: Mostar index; Bond-additive index; Bicyclic graphs (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300319302073
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:355:y:2019:i:c:p:319-324

DOI: 10.1016/j.amc.2019.03.014

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 ().