Independent sets in certain classes of (almost) regular graphs
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0310379,
title = {Independent sets in certain classes of (almost) regular graphs},
author = {Alexander Burstein and Sergey Kitaev and Toufik Mansour},
journal= {arXiv preprint arXiv:math/0310379},
year = {2007}
}
Comments
11 pages, 5 figures