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 language | English |
---|---|
Pages (from-to) | 1841-1845 |
Number of pages | 5 |
Journal | Applied Mathematics Letters |
Volume | 22 |
Issue number | 12 |
Early online date | 27 Jul 2009 |
DOIs | |
Publication status | Published - 31 Dec 2009 |
Keywords
- Connectivity index
- Extremal graph
- Hexagonal chain
- Recursive formula
- Third-order Randić index
ASJC Scopus subject areas
- Applied Mathematics