Comparison between the zeroth-order Randić index and the sum-connectivity index

Kinkar Ch. Das and Matthias Dehmer

Applied Mathematics and Computation, 2016, vol. 274, issue C, 585-589

Abstract: The zeroth-order Randić index and the sum-connectivity index are very popular topological indices in mathematical chemistry. These two indices are based on vertex degrees of graphs and attracted a lot of attention in recent years. Recently Li and Li (2015) studied these two indices for trees of order n. In this paper we obtain a relation between the zeroth-order Randić index and the sum-connectivity index for graphs. From this we infer an upper bound for the sum-connectivity index of graphs. Moreover, we prove that the zeroth-order Randić index is greater than the sum-connectivity index for trees. Finally, we show that R2, α(G) is greater or equal R1, α(G) (α ≥ 1) for any graph and characterize the extremal graphs.

Keywords: Molecular graph; Zeroth-order Randić index; Sum-connectivity index (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315015180
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:274:y:2016:i:c:p:585-589

DOI: 10.1016/j.amc.2015.11.029

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