On integer sequences associated with the cyclic and complete graphs

Paul Barry

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)

Abstract

We study integer sequences associated with the cyclic graph Cr and the complete graph Kr. Fourier techniques are used to characterize the sequences that count walks of length n on both these families of graphs. In the case of the cyclic graph, we show that these sequences are associated with an induced colouring of Pascal's triangle. This extends previous results concerning the Jacobsthal numbers.

Original languageEnglish
Article number07.4.8
JournalJournal of Integer Sequences
Volume10
Issue number4
Publication statusPublished - 04 May 2007

Keywords

  • Circulant matrices
  • Cyclic graphs
  • Discrete Fourier transform
  • Integer sequences
  • Jacobsthal numbers
  • Pascal's triangle

Fingerprint

Dive into the research topics of 'On integer sequences associated with the cyclic and complete graphs'. Together they form a unique fingerprint.

Cite this