Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (Q6089577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7764041
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs |
scientific article; zbMATH DE number 7764041 |
Statements
Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs (English)
0 references
13 November 2023
0 references
multiple leaf-distance granular regular \(\alpha\)-subtree (LDR \(\alpha\)-subtree)
0 references
generating function
0 references
unicyclic graphs
0 references
edge-disjoint bicyclic graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9108722805976868
0 references
0.7985749840736389
0 references
0.7658771276473999
0 references
0.761678159236908
0 references
