Graph Theory
Note: A proof of a conjecture on the Randić index of graphs with given girth
Discrete Applied Mathematics
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 in G and the summation extends over all edges uv of G. In this work, we give a sharp upper bound and a lower bound of the Randic index among connected n-vertex graphs with girth g=k(k=3).