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

# Given any positive integer n, (a) find a connected graph with n edge such that removal of just one edge disconnected the graph; (b) find a connected graph with n edge that cannot be disconnected by the removal of any single edge.

To determine

(a)

Given any positive integer n, find a connected graph with n edges such that removal of just one edge disconnects the graph.

Explanation

Given information:

Let G be the graph

and consider the walk v1e1v2e2v1.

Calculation:

Let n be any positive integer.

Consider the graph with ( n + 1 ) vertices V1,V2,

To determine

(b)

Given any positive integer n, find a connected graph with n edges that cannot be disconnected by the removal of any single edge.

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