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

# A graph has eight vertices and six edges. Is it connected? Why?

To determine

To check:

Whether a graph, having eight vertices and six edges, is connected or not.

Explanation

Given information:

A graph has eight vertices and six edges.

Concept used:

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

Calculation:

Suppose there were a connected graph with eight vertices and six edges. Either the graph itself would be a tree or edges could be eliminated from its circuit to obtain a tree

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