Counting independent sets in Riordan graphs (Q2198385)
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: Counting independent sets in Riordan graphs |
scientific article; zbMATH DE number 7245947
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting independent sets in Riordan graphs |
scientific article; zbMATH DE number 7245947 |
Statements
Counting independent sets in Riordan graphs (English)
0 references
10 September 2020
0 references
Riordan graph
0 references
Toeplitz graph
0 references
independent set
0 references
pattern avoiding sequence
0 references
Fibonacci number
0 references
Pell number
0 references
Hamiltonian path
0 references
0 references
0.93636984
0 references
0.9341397
0 references
0.9332143
0 references
0.9327266
0 references
0.92681766
0 references
0 references
0.9244788
0 references
0.9238037
0 references
