Graph TheorySuperchallengeWalks, Paths and Connectivity
Walks, Paths and Connectivity · Superchallenge problem
Let be three triangles sharing a single common vertex : triangles on , , and . Find the number of closed walks of length at vertex , minus the number of closed walks of length at vertex .