# a. Prove that if a walk in a graph contains a repeated edge, then the walk contains a repeated…

a. Prove that if a walk in a graph contains a repeated edge, then the walk contains a repeated…

a. Prove that if a walk in a graph contains a repeated edge, then the walk contains a repeated vertex.

b. Explain how it follows from part (a) that any walk with no repeated vertex has no repeated edge.

a. Prove that if a walk in a graph contains a repeated edge, then the walk contains a repeated…