A lower bound of revised Szeged index of bicyclic graphs

Shengjin Ji, Mengmeng Liu and Jianliang Wu

Applied Mathematics and Computation, 2018, vol. 316, issue C, 480-487

Abstract: The revised Szeged index of a graph is defined as Sz*(G)=∑e=uv∈E(nu(e)+n0(e)2)(nv(e)+n0(e)2), where nu(e) and nv(e) are, respectively, the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u, and n0(e) is the number of vertices equidistant to u and v. In the paper, we identify the lower bound of revised Szeged index among all bicyclic graphs, and also characterize the extremal graphs that attain the lower bound.

Keywords: Wiener index; Revised Szeged index; Bicyclic graph (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317306021
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:316:y:2018:i:c:p:480-487

DOI: 10.1016/j.amc.2017.08.051

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