pith. machine review for the scientific record. sign in

arxiv: 1412.2426 · v1 · pith:4O6EKO4Znew · submitted 2014-12-08 · 🧮 math.CO · math.NT

A bijection between aperiodic palindromes and connected circulant graphs

classification 🧮 math.CO math.NT
keywords circulantconnectedgraphsrespcorrespondenceorderpalindromesaperiodic
0
0 comments X
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.