Graph TheoryHardWalks, Paths and Connectivity
Walks, Paths and Connectivity · Hard problem
Let be two triangles sharing a single vertex: one on vertices and the other on vertices (vertex is the shared vertex, and there is no edge or beyond the triangle sides). How many closed walks of length start and end at vertex ?