As one of the counting-based topological indices, the number of subtrees and its variations has received much attention in recent years. In this paper, using generating functions, we investigate and derive formulas for this index of hexagonal and phenylene chains. We also present graph-theoretical algorithms for enumerating subtrees of these two chains. Extremal values and graphs with respect to the subtree number among all hexagonal and phenylene chains with n hexagons are also determined. As an application, we briefly examine the subtree densities of these two chains.
Available at: http://works.bepress.com/hua_wang/128/