Department of Mathematics
The maximum Randić index of chemical trees with k pendants
A tree is a chemical tree if its maximum degree is at most 4. Hansen and Mélot [P. Hansen, H. Mélot, Variable neighborhood search for extremal graphs 6: analyzing bounds for the connectivity index, J. Chem. Inf. Comput. Sci. 43 (2003) 1-14], Li and Shi [X. Li, Y.T. Shi, Corrections of proofs for Hansen and Mélot's two theorems, Discrete Appl. Math., 155 (2007) 2365-2370] investigated extremal Randić indices of the chemical trees of order n with k pendants. In their papers, they obtained that an upper bound for Randić index is frac(n, 2) + frac((3 sqrt(2) + sqrt(6) - 7) k, 6). This upper bound is sharp for n ≥ 3 k - 2 but not for n < 3 k - 2. In this paper, we find the maximum Randić index for n < 3 k - 2. Examples of chemical trees corresponding to the maximum Randić indices are also constructed. © 2009 Elsevier B.V. All rights reserved.
Chemical trees, Connectivity index, Randić index
Source Publication Title
Link to Publisher's Edition
Shiu, W., & Zhang, L. (2009). The maximum Randić index of chemical trees with k pendants. Discrete Mathematics, 309 (13), 4409-4416. https://doi.org/10.1016/j.disc.2009.01.021