Discrete Mathematics
A linear-programming approach to the generalized Randić index
Discrete Applied Mathematics
Graph Theory
Brief Communication: Graphs with maximum connectivity index
Computational Biology and Chemistry
| Hi-index | 0.04 |
The Randic index R(G) of a graph G is defined by R(G)=@?"u"v1d(u)d(v), where d(u) is the degree of a vertex u and the summation extends over all edges uv of G. Delorme et al. (2002) [6] put forward a conjecture concerning the minimum Randic index among alln-vertex connected graphs with the minimum degree at least k. In this work, we show that the conjecture is true given the graph contains k vertices of degree n-1. Further, it is true among k-trees.