On connected graphs and trees with maximal inverse sum indeg index

Xiaodan Chen, Xiuyu Li and Wenshui Lin

Applied Mathematics and Computation, 2021, vol. 392, issue C

Abstract: Let G=(V,E) be a graph. The inverse sum indeg index (ISI index in short) of G is defined as ISI(G)=∑vivj∈Edidj/(di+dj), where di is the degree of vertex vi. This recently developed topological index can predict total surface area for octane isomers. It is known that the star Sn uniquely minimizes the ISI index among n-vertex trees. However, characterizing n-vertex tree(s) with maximal ISI index (optimal trees, for convenience) appears to be difficult. There are even no sound conjectures on their structure up to now.

Keywords: Trees; Inverse sum indeg index; Extremal graphs; Greedy tree (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320306846
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:392:y:2021:i:c:s0096300320306846

DOI: 10.1016/j.amc.2020.125731

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