The maximum Randić index of chemical trees with k pendants

Wai Chee SHIU, Lian zhu Zhang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)4409-4416
Number of pages8
JournalDiscrete Mathematics
Volume309
Issue number13
DOIs
Publication statusPublished - 6 Jul 2009

Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

User-Defined Keywords

  • Chemical trees
  • Connectivity index
  • Randić index

Fingerprint

Dive into the research topics of 'The maximum Randić index of chemical trees with k pendants'. Together they form a unique fingerprint.

Cite this