### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 17-26 |

Number of pages | 10 |

Journal | Pure Mathematics and Applications |

Volume | 19 |

Issue number | 2-3 |

Publication status | Published - 2008 |

### Keywords

- independent sets
- regular graphs
- transfer matrix method
- bijection

## Fingerprint Dive into the research topics of 'Counting independent sets in certain classes of (almost) regular graphs'. Together they form a unique fingerprint.

## Cite this

Burstein, A., Kitaev, S., & Mansour, T. (2008). Counting independent sets in certain classes of (almost) regular graphs.

*Pure Mathematics and Applications*,*19*(2-3), 17-26.