Preview
![image preview](https://digitalcommons.humboldt.edu/inrsep_posters/1006/preview.jpg)
Publication Date
2017
Abstract
In this project we present a proof that given a positive integer r, the inverse binomial transform performed on the sequence of powers of r preceded by 0 produces the sequence whose nth term is the number of walks of length n on the complete graph in r vertices.
Research Experience for Undergraduates (REU) Scholarship
1
COinS