Bibliographic Details
| Title: |
Enumeration Of Subtrees Of Two Families Of Self-Similar Networks Based On Novel Two-Forest Dual Transformations. |
| Authors: |
Sun, Daoqiang1, Liu, Hongbo1 yangyu@sjtu.edu.cn, Yang, Yu2,3 yangyu@sjtu.edu.cn, Li, Long3, Zhang, Heng2, Fahad, Asfand4,5 |
| Source: |
Computer Journal. May2024, Vol. 67 Issue 5, p1652-1662. 11p. |
| Subjects: |
Combinatorial enumeration problems, Generating functions, Lattice theory, Molecular graphs, Polynomials |
| Abstract: |
As a structural topological index, the number of subtrees has great significance for the analysis and design of hybrid locally reliable networks. In this paper, with generating function and introducing a novel two-forest dual transformation technique, we solve the subtree enumerating problems of two representatives of the self-similar networks, such as the hierarchical lattice and |$(u,v)$| -flower networks. Moreover, by means of the circle weight transfer technique, two linear time algorithms of computing the subtree generation functions of these two families of networks are also proposed. The subtree density of two special cases for these self-similar networks is briefly discussed as an application. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
