Ordering chemical graphs by Randić and sum-connectivity numbers

Ali Ghalavand and Ali Reza Ashrafi

Applied Mathematics and Computation, 2018, vol. 331, issue C, 160-168

Abstract: Let G be a graph with edge set E(G). The Randić and sum-connectivity indices of G are defined as R(G)=∑uv∈E(G)1degG(u)degG(v) and SCI(G)=∑uv∈E(G)1degG(u)+degG(v), respectively, where degG(u) denotes the vertex degree of u in G. In this paper, the extremal Randić and sum-connectivity index among all n-vertex chemical trees, n ≥ 13, connected chemical unicyclic graphs, n ≥ 7, connected chemical bicyclic graphs, n ≥ 6 and connected chemical tricyclic graphs, n ≥ 8, were presented.

Keywords: Chemical graph; Randić index; Sum-connectivity index; Graph transformation (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/S0096300318301590
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:331:y:2018:i:c:p:160-168

DOI: 10.1016/j.amc.2018.02.049

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