   Chapter 10.1, Problem 51ES ### 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 that any graph with an Euler circuit is connected.

To determine

Prove that any graph with an Euler circuit is connected.

Explanation

Given information:

any graph with an Euler circuit.

Calculation:

Let G be a graph that contains some Euler circuit E where ei are the edges in G and vi are the vertices in G ( i = 1, 2,…, n and n a positive integer).

Let us assume that G is not connected. Then there exists two vertices v and w such that there does not exists a walk between v and w.

Note that v and w need to be distinct, because else v is a walk from v to 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 