Graph TheoryEasyWalks, Paths and Connectivity
Walks, Paths and Connectivity · Easy problem
A triangle on vertices has an extra vertex attached only to vertex , and another extra vertex attached only to vertex (edges ). How many walks of length are there from vertex to vertex ?