Extremal trees for the Randić index with given domination number

Sergio Bermudo, Juan E. Nápoles and Juan Rada

Applied Mathematics and Computation, 2020, vol. 375, issue C

Abstract: The Randić index is the topological index most widely used in applications for chemistry and pharmacology. It is defined for a graph G with vertex set V(G) and edge set E(G) asR(G)=∑uv∈E(G)1deg(u)deg(v),where deg(u) and deg(v) denote the degrees of the vertices u, v ∈ V(G). In this paper we find upper and lower bounds of the Randić index of trees in terms of the order and the domination number. The extremal trees are characterized.

Keywords: Randić index; Domination number (search for similar items in EconPapers)
Date: 2020
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/S0096300320300916
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:375:y:2020:i:c:s0096300320300916

DOI: 10.1016/j.amc.2020.125122

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