   Chapter 10.1, Problem 57ES ### 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

# An alternative proof for Theorem 10.1.3 has the following outline. Suppose G is a connected graph in which every vertex has even degree. Suppose the path C: v1e1v2e2v3…envn+1 has maximum length in G. That is, C has at least as many vertices and edges as any other path in G. First derive a contradiction from the assumption that v 1 ≠ v n . Next let H be the subgraph of G that contains all the vertices and edges in C. Then derive a contraction from the assumption that H ≠ G . Show that H contains every vertex of G, and show that H contains every edge of G.

To determine

To derive the contradiction from the assumption that v1vn and then derive the contraction from the assumption that HG to show that H contains every vertex and every edge of G.

Explanation

Given information:

Suppose G is a connected graph in which every vertex has even degree. Suppose the path C:v1e1v2e2v3.........envn+1 has maximum length in G. Let H be the sub graph of G that contains all the vertices and edges in C.

Calculation:

It is given that G is a connected graph in which every vertex has even degree and the path C:v1e1v2e2v3.........envn+1 has maximum length in G that means C has at least as many vertices and edges as any other path in G.

Now by using the method of contradiction let us suppose that there is no cycle in the graph G that means v1vn if v1 and vn are the starting and ending vertex.

Step 1. It is given that the every vertex in G has even degree. This means the graph should have a closed walk with starting and ending vertices same. The graph will contain a Euler Circuit.

Step 2. By Euler’s theorem if all the vertices of a graph has the even degree, then that graph is known as the Euler’s graph.

Step 3. In our assumption v1vn means there will be no path like C:v1e1v2e2v3

### 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 