| Autor: |
Sun, Daoqiang, Liu, Hongbo, Yang, Yu, Li, Long, Zhang, Heng, Fahad, Asfand |
| Předmět: |
|
| Zdroj: |
Computer Journal; May2024, Vol. 67 Issue 5, p1652-1662, 11p |
| Abstrakt: |
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] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
