具有极大和次大广义Randi-指数的极值化学树

下载PDF

导出

摘要通过对化学树定义一个新的分类,提出了当a>0且n≥9时,具有极大和次大广义Randi-指数的极值化学树就在此分类中,并给出了详细证明.同时,给出了在上述条件下,极大和次大广义Randic-指数的差值.

作者许妙琴

机构地区青海师范大学数学与信息科学系

出处《江汉大学学报（自然科学版）》 2010年第3期13-14,共2页 Journal of Jianghan University：Natural Science Edition

关键词广义Randi-指数化学树度序列

参考文献10

1Wiener H. Structural determination of paraffin boiling points[J]. J Am Chem Soc,1947,69:17-20.
2Kier L B, Hall L H. Molecular connectivity in chemistry and drug research[M]. New York:Academic Press, 1976.
3Kier L B, Hall L H. Molecular connectivity in structureactivity analysis[M]. New York:Wiley, 1986.
4Hu Y, Li X., Yuan Y.Trees with minimum general Randic index[J].MATCH Commun Math Comput Chem,2004, 52: 119-146.
5Hu Y, Li X, Yuan Y. Trees with maximum general Randic index[J]. MATCH Commun Math Comput Chem,2004, 52: 119-146.
6Li X, Yuan Y. On the lower and upper bounds for general Randic index of chemical(n,m)-graphs[J]. MATCH Commun Math Comput Chem, 2004, 52:157-166.
7Gutman I, Miljkovic O, Caporossi G, et al. Alkanes with small and large Randic connectivity indices[J]. Chem Phys Lett, 1999, 306: 366-372.
8Li X, Zheng J.Extremal chemical trees with minimum or maximum general Randic index [J]. MATCH Commun Math Comput Chem, 2006, 55: 381-390.
9Bollobas B. Graph theory:an introductory course[M]. New York: Spring-Verlag, 1979.
10Bollobas B, Erdos E Graphs with extremal weights[J]. Ars Combin,1998, 50:225-233.

江汉大学学报（自然科学版）

2010年第3期

内容加载中请稍等...