On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains

Authors

• Yu Yang, Pingdingshan University
• Hongbo Liu, Dalian Maritime UniversityFollow
• Hua Wang, Georgia Southern UniversityFollow
• Ansheng Deng, Dalian Maritime University
• Colton Magnant, Georgia Southern UniversityFollow

Document Type

Article

Publication Date

4-1-2017

Publication Title

The Computer Journal

DOI

10.1093/comjnl/bxw091

ISSN

1460-2067

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.

Recommended Citation

Yang, Yu, Hongbo Liu, Hua Wang, Ansheng Deng, Colton Magnant. 2017. "On Algorithms for Enumerating Subtrees of Hexagonal and Phenylene Chains." The Computer Journal, 60 (5): 690-710. doi: 10.1093/comjnl/bxw091
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/595

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.