Enumeration problems for classes of self-similar graphs (Q2384571)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration problems for classes of self-similar graphs |
scientific article; zbMATH DE number 5199327
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration problems for classes of self-similar graphs |
scientific article; zbMATH DE number 5199327 |
Statements
Enumeration problems for classes of self-similar graphs (English)
0 references
10 October 2007
0 references
Self-similar graph
0 references
enumeration
0 references
polynomial recursion
0 references
0 references
0.8360838294029236
0 references
0.8280209302902222
0 references
0.801943302154541
0 references
0.7865551710128784
0 references
0.7831009030342102
0 references
