Apr 20, 2016 · We extend this study to the enumeration of BC-subtrees containing some specific vertex or two distinct vertices of unicyclic and edge-disjoint ...

Using these results and through generating functions of BC-subtrees, we present graph-theoretical based algorithms for enumerating BC-subtrees, BC-subtrees ...

Recursion formulas for computing the BC-subtree generating functions of multi-fan and multi-wheel graphs are provided and a new perspective on understanding ...

Using these results and through generating functions of BC-subtrees, we present graph-theoretical based algorithms for enumerating BC-subtrees, BC-subtrees ...

Using these results and through generating functions of BC-subtrees, we present graph-theoretical based algorithms for enumerating BC-subtrees, BC-subtrees ...

On Algorithms for Enumerating BC-Subtrees of Unicyclic and Edge-Disjoint Bicyclic Graphs. Yu Yang, Hongbo Liu, Hua Wang, Shigang Feng. Mathematical Sciences.

Feb 1, 2024 · In this paper, we propose algorithms for enumerating an auxiliary subtree -subtree containing a fixed vertex, and various LDR α-subtrees of unicyclic graphs, ...

On Algorithms for Enumerating BC-subtrees of Unicyclic and Edge-disjoint Bicyclic Graphs. Article. Full-text available. Sep 2015; DISCRETE APPL MATH.

Basing on these algorithms, we further present algorithms for enumerating various LDR α-subtrees of edge-disjoint bicyclic graphs. Suggested Citation. Li, Long ...

Oct 7, 2021 · Through an approach based on generating functions, we present recursive algorithms for enumerating various subtrees and BC-subtrees of maximum ...