Question
Prove that, if two vertices of a general graph are joined by a walk, then they are joined by a path.
Step 1
Suppose there is a walk between two vertices, say vertex A and vertex B, in a graph. A walk is a sequence of vertices and edges such that each edge is incident to the vertices immediately before and after it in the sequence. Show more…
Show all steps
Your feedback will help us improve your experience
Prathan Jarupoonphol and 85 other Precalculus educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove that any two longest paths in a connected graph G must share a common vertex.
Show that in a simple graph with at least two vertices there must be two vertices that have the same degree.
Graphs
Graph Terminology and Special Types of Graphs
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD