A bijection between aperiodic palindromes and connected circulant graphs
classification
🧮 math.CO
math.NT
keywords
circulantconnectedgraphsrespcorrespondenceorderpalindromesaperiodic
read the original abstract
In this paper, we show that there is a one-to-one correspondence between the set of compositions (resp. prime compositions) of $n$ and the set of circulant digraphs (resp. connected circulant digraphs) of order $n$. We also show that there is a one-to-one correspondence between the set of palindromes (resp. aperiodic palindromes) of $n$ and the set of circulant graphs (resp. connected circulant graphs) of order $n$. As a corollary of this correspondence, we enumerate the number of connected circulant (di)graphs of order $n$.
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.