Graph TheoryEasyWalks, Paths and Connectivity
Walks, Paths and Connectivity · Easy problem
A triangle on vertices has an extra vertex attached only to vertex (edges ). How many closed walks of length start and end at vertex ?
A triangle on vertices has an extra vertex attached only to vertex (edges ). How many closed walks of length start and end at vertex ?