论文信息 - On the Randić index of cacti

On the Randić index of cacti

The Randić index of an organic molecule whose molecular graph is G is the sum of the weights (d(u)d(v))− 1 2 of all edges uv of G, where d(u) and d(v) are the degrees of the vertices u and v in G. In the paper, we give a sharp lower bound on the Randić index of cacti.

LU Mei | Lianzhu ZHANG | Feng TIAN

[1] Jinwu Gao,et al. On the Randić Index of Unicyclic Graphs , 2004 .

[2] Mirko Lepovic,et al. Choosing the exponent in the definition of the connectivity index , 2001 .

[3] Ivan Gutman,et al. Ordering of alkane isomers by means of connectivity indices , 2002 .

[4] D. Cvetkovic,et al. Variable neighborhood search for extremal graphs 3 , 2001 .

[5] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..

[6] M. Randic. Characterization of molecular branching , 1975 .

[7] L. Hall,et al. Molecular connectivity in chemistry and drug research , 1976 .

[8] Béla Bollobás,et al. Graphs of Extremal Weights , 1998, Ars Comb..

[9] I. W Nowell,et al. Molecular Connectivity in Structure-Activity Analysis , 1986 .

[10] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index , 2001, J. Chem. Inf. Comput. Sci..