Independent sets in certain classes of (almost) regular graphs
classification
🧮 math.CO
keywords
graphsregularalmostclassescorrespondingindependentsetsbijections
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.