The hexagonal chains with the extremal third-order Randić index

Jie Zhang, Hanyuan Deng

Research output: Contribution to journalArticlepeer-review

5 Citations (SciVal)

Abstract

The third-order Randić index of a graph G is defined as R3 (G) = ∑u1 u2 u3 u4 frac(1, sqrt(d (u1) d (u2) d (u3) d (u4))), where the summation is taken over all possible paths of length three of G. A recursive formula for computing the third-order Randić index of a hexagonal chain is given in this paper, and the hexagonal chains with the extremal third-order Randić index are characterized.

Original languageEnglish
Pages (from-to)1841-1845
Number of pages5
JournalApplied Mathematics Letters
Volume22
Issue number12
Early online date27 Jul 2009
DOIs
Publication statusPublished - 31 Dec 2009

Keywords

  • Connectivity index
  • Extremal graph
  • Hexagonal chain
  • Recursive formula
  • Third-order Randić index

ASJC Scopus subject areas

  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The hexagonal chains with the extremal third-order Randić index'. Together they form a unique fingerprint.

Cite this