REVIEW 1 cited by
Counting independent sets in Riordan graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent sets in Riordan graphs. In this paper, we give exact enumeration and lower and upper bounds for the number of independent sets for various classes of Riordan graphs. Remarkably, we offer a variety of methods to solve the problems that range from the structural decomposition theorem to methods in combinatorics on words. Some of our results are valid for any graph.
Forward citations
Cited by 1 Pith paper
-
Review of the experimental and theoretical landscape of electron transport in noble liquids
A survey plus curated database of electron mobility and diffusion data for liquid argon and xenon, arguing that liquid-specific coherent scattering and screened potentials are required to match TPC measurements.
Discussion (0). Continue with ORCID to comment.