The general Randić index of trees with given number of pendent vertices

Qing Cui and Lingping Zhong

Applied Mathematics and Computation, 2017, vol. 302, issue C, 111-121

Abstract: The general Randić index of a graph G is defined as Rα(G)=∑uv∈E(G)(d(u)d(v))α, where d(u) denotes the degree of a vertex u in G and α is a real number. In this paper, we determine the maximum general Randić indices of trees and chemical trees with n vertices and k pendent vertices for 4≤k≤⌊n+23⌋ and α0 ≤ α < 0, where α0≈−0.5122 is the unique non-zero root of the equation 6·4α−20·9α+10·12α−16α+5·24α=0. The corresponding extremal graphs are also characterized.

Keywords: Randić index; General Randić index; Tree; Chemical tree (search for similar items in EconPapers)
Date: 2017
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/S0096300317300292
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:302:y:2017:i:c:p:111-121

DOI: 10.1016/j.amc.2017.01.021

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