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

# Is a circuit-free graph with n vertices and at least n − 1 edges connected? Why?

To determine

To check:

Whether a circuit free graph with n vertices and at least n1 edges is connected or not.

Explanation

Given information:

A circuit free graph with n vertices and at least n1 edges.

Concept used:

Any tree with n vertices has n1 edges and total degree is 2(n1).

Calculation:

Suppose G is a circuit free graph with n vertices and n1 edges. Let G1,G2,.....,Gk be the connected component of G. To show that G is connected, we will show that k=1.

Each graph Gi is a tree since each Gi is connected and circuit free.

For each i=1,2,......,k let Gi have ni vertices. Then,

n1+n2+....+nk=n

For a positive integer n any tree with n vertices has n1 edges.

Thus, G1 has n11 edges.

G2 has n21 edges

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