# Word problem (airports)

Not what you're looking for?

1998 airports are each connected in both directions to exactly three other airports. Any airport can be reached from any other airport by a sequence of flights. It is decided to close down 200 of the airports, no two of which are connected by a single flight. Show that this can be done in such a way that any remaining airport can be reached by a sequence of flights from any other remaining airport.

##### Purchase this Solution

##### Solution Summary

This is a word problem regarding connecting flights and airports.

##### Solution Preview

See the attachment.

Suppose the structure of the original 1998 airports is like the sketch in the following, where each "nod" represents one airport and each airport is connected to exact three other airports and each airport and be connected to any other airport ...

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Probability Quiz

Some questions on probability

##### Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

##### Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

##### Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

##### Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.