Explore BrainMass

Explore BrainMass

    Word problem (airports)

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    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.

    © BrainMass Inc. brainmass.com November 30, 2021, 12:01 am ad1c9bdddf
    https://brainmass.com/math/algebra/word-problem-airports-15463

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

    Solution Summary

    This is a word problem regarding connecting flights and airports.

    $2.49

    ADVERTISEMENT