In a certain city there is a river running through the middle of ...

[Yolanda]

In a certain city there is a river running through the middle of the city.  There are four islands and eleven bridges as shown in the figure below.

A graph that appropriately models this situation would have
◦ 6 vertices and 11 edges.
◦ 11 vertices and 6 edges.
◦ 4 vertices and 11 edges.
◦ 11 vertices and 4 edges.
◦ none of these

[chinwesucks]

6 vertices and 11 edges.

[mydiamond]

In a certain city there is a river running through the middle of the city.  There are four islands and eleven bridges as shown in the figure below.

In the graph that models this situation, the degree of the vertex that represents the North Bank is
◦ 4.
◦ 2.
◦ 3.
◦ 1.
◦ none of these

[Juro]

3.

[tnt_battle]

In a certain city there is a river running through the middle of the city. There are three islands and seven bridges as shown in the figure below.

It is possible to take a walk through this town, starting on the North Bank, crossing each bridge once (and only once) and ending
◦ on island B.
◦ back on the North Bank.
◦ on the South Bank.
◦ on island C.
◦ none of these

[Jody Vaughn]

on island C.

[c0205847]

In a certain city there is a river running through the middle of the city. There are three islands and seven bridges as shown in the figure below.

Which of the following statements is true?
◦ The graph that models this situation has an Euler path starting on the South Bank and ending on the North Bank.
◦ The graph that models this situation has an Euler circuit.
◦ No edge in the graph that models this situation is actually a bridge.
◦ All of these are true.
◦ None of these are true.

[frankwu0507]

No edge in the graph that models this situation is actually a bridge.

[Wadzanai]

In a certain city there is a river running through the middle of the city. There are three islands and seven bridges as shown in the figure below.

Suppose that there is a crossing charge of $1.00 every time one crosses a bridge. A tourist wants to start on the North Bank, stroll across each of the bridges at least once, and return to her hotel on the North Bank at the end of the trip.  What is the cheapest possible cost of such a trip?
◦ $14
◦ Such a trip is impossible.
◦ $7
◦ $8
◦ none of these

[Brenm]

$8