MathCastle
Graph TheorySuperchallengeWalks, Paths and Connectivity

Walks, Paths and Connectivity · Superchallenge problem

Let GG be three triangles sharing a single common vertex 00: triangles on {0,1,2}\{0,1,2\}, {0,3,4}\{0,3,4\}, and {0,5,6}\{0,5,6\}. Find the number of closed walks of length 66 at vertex 00, minus the number of closed walks of length 66 at vertex 11.