MathCastle
Graph TheoryChallengeWalks, Paths and Connectivity

Walks, Paths and Connectivity · Challenge problem

Let C9C_9 be the cycle on vertices 0,1,…,80,1,\ldots,8 (edges i,(i+1) mod 9i,(i+1)\bmod 9). How many closed walks of length 44 start and end at vertex 00?