Counting independent sets in Riordan graphs

Tools

Cheon, Gi-Sang and Jung, Ji-Hwan and Kang, Bumtle and Kim, Hana and Kim, Suh-Ryung and Kitaev, Sergey and Mojallal, Seyed Ahmad (2020) Counting independent sets in Riordan graphs. Discrete Mathematics, 343 (11). 112043. ISSN 0012-365X (https://doi.org/10.1016/j.disc.2020.112043)

[thumbnail of Cheon-etal-DM-2020-Counting-independent-sets-in-Riordan]
Preview
 Text. Filename: Cheon_etal_DM_2020_Counting_independent_sets_in_Riordan.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (292kB)| Preview

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.

ORCID iDs

Cheon, Gi-Sang, Jung, Ji-Hwan, Kang, Bumtle, Kim, Hana, Kim, Suh-Ryung, Kitaev, Sergey ORCID logoORCID: https://orcid.org/0000-0003-3324-1647 and Mojallal, Seyed Ahmad;
CORE (COnnecting REpositories)