Best lower and upper bounds for the Randić index R − 1 of chemical trees ∗
暂无分享,去创建一个
[1] Dieter Rautenbach. A note on trees of maximum weight and restricted degrees , 2003, Discret. Math..
[2] Gutman,et al. Bounds for the Randic connectivity index , 2000, Journal of chemical information and computer sciences.
[3] Lane H. Clark,et al. On the General Randic Index for Certain Families of Trees , 1999, Ars Comb..
[4] Béla Bollobás,et al. Graphs of Extremal Weights , 1998, Ars Comb..
[5] Dieter Rautenbach,et al. A Linear-programming Approach to the Generalized Randic Index , 2003, Discret. Appl. Math..
[6] M. Randic. Characterization of molecular branching , 1975 .
[7] P. Hansen,et al. Alkanes with small and large Randić connectivity indices , 1999 .
[8] Xueliang Li,et al. Sharp Bounds for the General Randi c Index , 2003 .
[9] Pierre Hansen,et al. Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..
[10] Pierre Hansen,et al. Graphs with maximum connectivity index , 2003, Comput. Biol. Chem..
[11] N. Trinajstic. Chemical Graph Theory , 1992 .