Abstract
We give the generating function for the number of independent sets on the class of well-based path-schemes (a kind of regularly structured graph), which generalizes the known result in this direction.
| Original language | English |
|---|---|
| Article number | 06.2.2 |
| Number of pages | 8 |
| Journal | Journal of Integer Sequences |
| Volume | 9 |
| Publication status | Published - 2006 |
Keywords
- independent sets
- path-schemes
- generating functions
- string avoidance