English

A bijection between aperiodic palindromes and connected circulant graphs

Combinatorics 2014-12-09 v1 Number Theory

Abstract

In this paper, we show that there is a one-to-one correspondence between the set of compositions (resp. prime compositions) of nn and the set of circulant digraphs (resp. connected circulant digraphs) of order nn. We also show that there is a one-to-one correspondence between the set of palindromes (resp. aperiodic palindromes) of nn and the set of circulant graphs (resp. connected circulant graphs) of order nn. As a corollary of this correspondence, we enumerate the number of connected circulant (di)graphs of order nn.

Keywords

Cite

@article{arxiv.1412.2426,
  title  = {A bijection between aperiodic palindromes and connected circulant graphs},
  author = {Hunki Baek and Sejeong Bang and Dongseok Kim and Jaeun Lee},
  journal= {arXiv preprint arXiv:1412.2426},
  year   = {2014}
}
R2 v1 2026-06-22T07:23:01.526Z