Maximum Randić index on Trees with k-pendant Vertices |
| |
| Authors: | Lian-Zhu Zhang Mei Lu Feng Tian |
| |
| Affiliation: | (1) School of Mathematical Science, Xiamen University, Xiamen, Fujian, 361005, China;(2) Department of Mathematical Sciences, Tsinghua University, Beijing, 100084, China;(3) Institute of Systems Science, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing, 100080, China |
| |
| Abstract: | 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. Let T be a tree with n vertices and k pendant vertices. In this paper, we give a sharp upper bound on Randić index of T. |
| |
| Keywords: | Randić index tree pendant vertex |
| 本文献已被 SpringerLink 等数据库收录！ |
|
