Note on two generalizations of the Randić index

Yongtang Shi

Applied Mathematics and Computation, 2015, vol. 265, issue C, 1019-1025

Abstract: For a given graph G, the well-known Randić index of G, introduced by Milan Randić in 1975, is defined as R(G)=∑uv∈E(G)(dudv)−1/2, where the sum is taken over all edges uv and du denotes the degrees of u. Bollobás and Erdös generalized this index by replacing −1/2 with any real number α, which is called the general Randić index. Dvořák et al. introduced a modified version of Randić index: R′(G)=∑uv∈E(G)(max{du,dv})−1. Based on this, recently, Knor et al. introduced two generalizations: Rα′(G)=∑uv∈E(G)min{duα,dvα}andRα′′(G)=∑uv∈E(G)max{duα,dvα},for any real number α. Clearly, the former is a lower bound for the general Randić index, and the latter is its upper bound. Knor et al. studied extremal values of Rα′(G) and Rα′′(G) and concluded some open problems. In this paper, we consider the open problems and give some comments and results. Some results for chemical trees are obtained.

Keywords: Randić index; Generalized Randić index; Extremal graph (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008000
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:265:y:2015:i:c:p:1019-1025

DOI: 10.1016/j.amc.2015.06.019

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