Randić index and the diameter of a graph

  title={Randi{\'c} index and the diameter of a graph},
  author={Zdenek Dvorak and Bernard Lidick{\'y} and Riste Skrekovski},
  journal={Eur. J. Comb.},
The Randić index R(G) of a nontrivial connected graph G is defined as the sum of the weights (d(u)d(v))− 1 2 over all edges e = uv ofG. We prove that R(G) ≥ d(G)/2, where d(G) is the diameter of G. This immediately implies that R(G) ≥ r(G)/2, which is the closest result to the well-known Grafiti conjecture R(G) ≥ r(G) − 1 of Fajtlowicz [4], where r(G) is the radius of G. Asymptotically, our result approaches the bound R(G) d(G) ≥ n−3+2 √ 2 2n−2 conjectured by Aouchiche, Hansen and Zheng [1]. 


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 12 references

On conjectures of Graffiti

Discrete Mathematics • 1988
View 4 Excerpts
Highly Influenced

Variable neighborhood search

European Journal of Operational Research • 2008
View 4 Excerpts
Highly Influenced

On a conjecture of the Randic index

Discrete Applied Mathematics • 2009
View 2 Excerpts

Mathematical Aspects of Randić - Type Molecular Structure Descriptors

X. Li, I. Gutman
Mathematical Chemistry Monographs No.1, Kragujevac, • 2006
View 2 Excerpts

Graphs of Extremal Weights

Ars Comb. • 1998
View 2 Excerpts

Molecular Connectivity in structure-Activity Analysis, Research Studies Press-Wiley

L. B. Kier, L. H. Hall
Chichester(UK), • 1986
View 1 Excerpt

Molecular Connectivity in Chemistry and Drug Research

L. B. Kier, L. H. Hall
View 1 Excerpt

Similar Papers

Loading similar papers…