   Chapter 10.1, Problem 44ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
1 views

# Prove Lemma 10.1.1(a): If G is a connected graph, then any two distinct vertices of G can be connected by a path. (You may use the result stated in exercise 43.)

To determine

To prove:

If G is a connected graph, then any two distinct vertices of G can be connected by a path.

Explanation

Given information:

G is a connected graph.

Proof:

Let G be a connected graph and let u and v be two distinct vertices of G.

Since G is connected, there exists a walk W between u and v.

If W contains a repeated vertex v, then delete the part of the walk between the two occurrences of v and rename the resulting walk as W...

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 