We enumerate the independent sets of several classes of regular and almost regular graphs and compute the corresponding generating functions. We also note the relations between these graphs and other combinatorial objects and, in some cases, construct the corresponding bijections.
|Number of pages||10|
|Journal||Pure Mathematics and Applications|
|Publication status||Published - 2008|
- independent sets
- regular graphs
- transfer matrix method