Graph TheoryChallengeWalks, Paths and Connectivity
Walks, Paths and Connectivity · Challenge problem
Let be two -cycles, and , joined by the two edges and . Every vertex of has degree except , which have degree . Find .
Let be two -cycles, and , joined by the two edges and . Every vertex of has degree except , which have degree . Find .