Skip to main content
Article
On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains
The Computer Journal
  • Yu Yang, Pingdingshan University
  • Hongbo Liu, Dalian Maritime University
  • Hua Wang, Georgia Southern University
  • Ansheng Deng, Dalian Maritime University
  • Colton Magnant, Georgia Southern University
Document Type
Article
Publication Date
4-1-2017
DOI
10.1093/comjnl/bxw091
Disciplines
Abstract
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.
Citation Information
Yu Yang, Hongbo Liu, Hua Wang, Ansheng Deng, et al.. "On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains" The Computer Journal Vol. 60 Iss. 5 (2017) p. 690 - 710 ISSN: 1460-2067
Available at: http://works.bepress.com/colton_magnant/62/