arXiv Analytics

Sign in

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
Subjects: 05A05, 05A15, 30B70, 42C05
Related articles: Most relevant | Search more
arXiv:0810.0866 [math.CO] (Published 2008-10-06, updated 2012-09-16)
The enumeration of independent sets on some lattices
arXiv:1211.4532 [math.CO] (Published 2012-11-19, updated 2013-12-08)
On the densities of cliques and independent sets in graphs
arXiv:1406.4100 [math.CO] (Published 2014-06-16, updated 2015-02-15)
Ascent sequences avoiding pairs of patterns