On the sharp bounds of bicyclic graphs regarding edge Szeged index

Yan Yao, Shengjin Ji and Guang Li

Applied Mathematics and Computation, 2020, vol. 377, issue C

Abstract: For a given graph G, its edge Szeged index is denoted by Sze(G)=∑e=uv∈E(G)mu(e)mv(e), where mu(e) and mv(e) are the number of edges in G with distance to u less than to v and the number of edges in G further (distance) to u than v, respectively. In the paper, the bounds of edge Szeged index on bicyclic graphs are determined. Furthermore, the graphs that achieve the bounds are completely characterized.

Keywords: Edge Szeged index; Szeged index; Wiener index; Extremal structure; Graph operation (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320301041
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:377:y:2020:i:c:s0096300320301041

DOI: 10.1016/j.amc.2020.125135

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