# A complete network of size n is n points connected by line segments, as shown below. What is the minimum

## Question:

A complete network of size n is n points connected by line segments, as shown below. What is the minimum number of segments that must be removed from a complete network of size 5 so that one point has no segments connected to it?

A. 1

B. 2

C. 3

D. 4

E. 5

## This problem has been solved!

Do you need an answer to a question different from the above? Ask your question!

## Step by Step Answer:

**Related Book For**

## McGraw Hills Conquering SAT Math

**ISBN:** 9780071493413

2nd Edition

**Authors:** Robert Postman, Ryan Postman

**Question Details**

Chapter #

**22**Section: Section 3.1

Problem: 5

**View Solution**

Create a free account to access the answer

**Cannot find your solution?**

Post a FREE question now and get an answer within minutes.
* Average response time.