arXiv:math/0310379 [math.CO]AbstractReferencesReviewsResources
Independent sets in certain classes of (almost) regular graphs
Alexander Burstein, Sergey Kitaev, Toufik Mansour
Published 2003-10-23Version 1
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.
Comments: 11 pages, 5 figures
Categories: math.CO
Related articles: Most relevant | Search more
The enumeration of independent sets on some lattices
On the densities of cliques and independent sets in graphs
Ascent sequences avoiding pairs of patterns