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 language | English |
---|---|
Article number | 07.4.8 |
Journal | Journal of Integer Sequences |
Volume | 10 |
Issue number | 4 |
Publication status | Published - 04 May 2007 |
Keywords
- Circulant matrices
- Cyclic graphs
- Discrete Fourier transform
- Integer sequences
- Jacobsthal numbers
- Pascal's triangle