Document Type

Journal Article

Department/Unit

Department of Mathematics

Title

The maximum Randić index of chemical trees with k pendants

Language

English

Abstract

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.

Keywords

Chemical trees, Connectivity index, Randić index

Publication Date

2009

Source Publication Title

Discrete Mathematics

Volume

309

Issue

13

Start Page

4409

End Page

4416

Publisher

Elsevier

DOI

10.1016/j.disc.2009.01.021

Link to Publisher's Edition

http://dx.doi.org/10.1016/j.disc.2009.01.021

ISSN (print)

0012365X

ISSN (electronic)

1872681X

This document is currently not available here.

Share

COinS