Scribd
Upload
736 views4 pages

Travel. A Map of Negros Island Is Shown Below.: Challenge Yourself!

The document describes a challenge involving traveling between cities on Negros Island in the Philippines. It includes a map of Negros Island showing the cities and borders between them. The challenge involves: 1) Drawing a graph representing the cities and borders, 2) Determining if a route crossing every border without repeating is possible, and 3) Finding the optimal route between Murcia that crosses every border while minimizing repeated crossings.

Uploaded by

Roseann Reyes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
736 views4 pages

Travel. A Map of Negros Island Is Shown Below.: Challenge Yourself!

The document describes a challenge involving traveling between cities on Negros Island in the Philippines. It includes a map of Negros Island showing the cities and borders between them. The challenge involves: 1) Drawing a graph representing the cities and borders, 2) Determining if a route crossing every border without repeating is possible, and 3) Finding the optimal route between Murcia that crosses every border while minimizing repeated crossings.

Uploaded by

Roseann Reyes
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Name: REYES, ROSE ANN Year and Section: BSEDFIL1A

Challenge Yourself!
(Let’s Try This #3)
1. Travel. A map of Negros Island is shown below.

Figure 6.14

a) Draw a graph in which the vertices represent the towns or cities in Negros Island and two
vertices are joined by an edge if the corresponding towns or cities share a common border.
b) Two friends are planning a driving tour in Negros Island. They would like to drive across
every border on the island. Is it possible to plan such a route that never crosses the same
border twice? What would the route correspond to on the graph?
Blue Lines indicate the edges that the two friends will travel.

c) Find a route the friends can follow that will start and end in Murcia and that crosses every
border while re-crossing the fewest borders possible. Hint: On the graph, add multiple
edges corresponding to border crossings that allow an Euler circuit.

You might also like