   Chapter 10.4, Problem 24ES ### 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

# Suppose that v is a vertex of degree 1 in a connected graph G and that e is the edge incident on v Let G ′ be the subgraph of G obtained by removing v and e from G. Must G ′ be connected? Why?

To determine

To find:

Whether G is connected or not.

Explanation

Given information:

v is a vertex of degree 1 in a connected graph G and that e is the edge incident on v. let G be the subgraph of G obtained by removing v and e from G.

Calculation:

Given:

G is a connected graph

v is a vertex of degree 1

e is the edge incident on v

G is the subgraph of G obtained by removing v and e from G

To proof: G’ is connected

Let a and b two vertices in the graph G.

Since G is the subgraph of G obtained by removing v and e from G, a andb are vertices in G with av and bv

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