An inequality between variable wiener index and variable szeged index

Katarína Hriňáková, Martin Knor and Riste Škrekovski

Applied Mathematics and Computation, 2019, vol. 362, issue C, -

Abstract: A well-known inequality between the Szeged and Wiener indices says that Sz(G)=∑e=ij∈E(G)ne(i)ne(j)≥∑{u,v}d(u,v)=W(G) for every graph G. In the past, variable variations of the standard topological indices were defined. Following this line, we study a natural generalisation of the above inequality, namely ∑e=ij∈E(G)(ne(i)ne(j))α≥∑{u,v}d(u,v)α. We show that for all trees the inequality is true if α > 1, and the opposite inequality holds if 0 ≤ α < 1. In fact, the first result also holds for bipartite graphs and for graphs on n vertices with at most n+3 edges, but the opposite one does not. For general graphs we solve also the case α < 0 and we present interesting conjectures. Observe, that both the sums are interesting on their own, and in accordance with the usual terminology they can be called the variable Szeged and variable Wiener indices.

Keywords: Variable Wiener index; Variable Szeged index; Inequality (search for similar items in EconPapers)
Date: 2019
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/S0096300319305405
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:362:y:2019:i:c:44

DOI: 10.1016/j.amc.2019.124557

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