Counting independent sets in Riordan graphs

DOI10.1016/j.disc.2020.112043zbMath1447.05106arXiv2006.16579OpenAlexW3038218193MaRDI QIDQ2198385

Bumtle Kang, Ji-Hwan Jung, Hana Kim, Gi-Sang Cheon, Seyed Ahmad Mojallal, Sergey Kitaev, Suh-Ryung Kim

Publication date: 10 September 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.16579

zbMATH Keywords

independent setToeplitz graphHamiltonian pathFibonacci numberPell numberRiordan graphpattern avoiding sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (2)

Enumeration of bipartite non-crossing geometric graphs ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the chromatic number of Toeplitz graphs
• On the chromatic number of integral circulant graphs
• Hamiltonian properties of Toeplitz graphs
• String overlaps, pattern matching, and nontransitive games
• Structural properties of Toeplitz graphs
• Riordan graphs I: structural properties
• Counting independent sets in graphs
• Riordan graphs. II: Spectral properties
• Characterizing bipartite Toeplitz graphs

This page was built for publication: Counting independent sets in Riordan graphs