Title of article
The hexagonal chains with the extremal third-order Randić index
Author/Authors
Zhang، نويسنده , , Jie and Deng، نويسنده , , Hanyuan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
1841
To page
1845
Abstract
The third-order Randić index of a graph G is defined as R 3 ( G ) = ∑ u 1 u 2 u 3 u 4 1 d ( u 1 ) d ( u 2 ) d ( u 3 ) d ( u 4 ) , 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.
Keywords
Hexagonal chain , Recursive formula , Extremal graph , Third-order Randi? index , Connectivity index
Journal title
Applied Mathematics Letters
Serial Year
2009
Journal title
Applied Mathematics Letters
Record number
1526430
Link To Document