Professional Documents
Culture Documents
Mathematical Excursions 4th Edition Aufmann Test Bank 1
Mathematical Excursions 4th Edition Aufmann Test Bank 1
Mathematical Excursions 4th Edition Aufmann Test Bank 1
a. (a) 4 verticles
(b) not connected
b. (a) 0 verticles
(b) connected
c. (a) 0 verticles
(b) not connected
d. (a) 4 verticles
(b) connected
e. (a) 2 verticles
(b) connected
ANSWER: d
a. (a) 6 verticles
(b) not connected
b. (a) 14 verticles
(b) connected
c. (a) 6 verticles
(b) connected
d. (a) 14 verticles
(b) not connected
e. (a) 10 verticles
(b) connected
ANSWER: c
a. (a) 7 verticles
(b) connected
b. (a) 7 verticles
(b) not connected
c. (a) 8 verticles
(b) not connected
d. (a) 8 verticles
(b) connected
e. (a) 10 verticles
(b) not connected
ANSWER: b
4. The table below shows all the nonstop airline flights available between five cities. Draw a graph to represent the
information, where each vertex represents a city and each nonstop flight between two cities is represented by an edge.
a.
b.
c.
d.
ANSWER: b
9. Use the Greedy Algorithm to find a Hamiltonian circuit starting at vertex D in the weighted graph shown below.
10. Use the Edge-Picking Algorithm to find a Hamiltonian circuit in the weighted graph shown below. Give the path and
its total weight.
ANSWER: ;
Pickup Point A B C D E
A — 8 12 9 —
B 8 — 8 16 18
C 12 8 — 16 8
D 9 16 16 — 15
E — 18 8 15 —
a. ; 48 mi
b. ; 48 mi
c. ; 46 mi
d. ; 46 mi
ANSWER: a
12. Suppose you are at the library and you need to visit the computer lab, the food court, the administration building, and
the campus police before returning to the library. The distances (in yards) between each of the places that you wish to
visit are listed in the table below. Find the distance you will travel if you use the Greedy Algorithm to find a short route
that starts and ends at the library.
a. 698 yds
b. 1,443 yds
c. 1,193 yds
d. 1,405 yds
e. 905 yds
ANSWER: d
13. A contest winner’s prize is a free round-trip airline ticket to any city in Europe, with an unlimited stay over. While
there, the contestant wants to travel to five other cities before returning to the original airport for the return flight home.
The table below shows the one-way airfares between the cities. Beginning with A, find a sequence of cities that can be
followed to give the lowest total airfare and give that airfare. Use the Edge-Picking Algorithm.
City A B C D E F
A — — $376 $358 $259 $369
B — — $450 $256 $301 $395
C $376 $450 — $289 $387 $431
D $358 $256 $289 — $299 $263
Copyright Cengage Learning. Powered by Cognero. Page 6
Chapter 05 - The Measurement of Graphs
14. Find a graph that shows that the given graph is planar.
a. b.
c. d.
e.
ANSWER: a
15. Find a graph that shows that the given graph is planar.
a. b.
c. d.
e.
ANSWER: c
16. Find a graph that shows that the given graph is planar.
a. b.
c. d.
e.
ANSWER: b
17. Find a graph that shows that the given graph is planar.
a. b.
c. d.
e.
ANSWER: b
18. Determine which graph is nonplanar and indicate whether it contains a Utilities Graph or as a subgraph.
a. II is nonplanar; it contains
b. III is nonplanar; it contains
c. I is nonplanar; it contains a Utilities Graph
d. II is nonplanar; it contains a Utilities Graph
e. III is nonplanar; it contains a Utilities Graph
ANSWER: e
Copyright Cengage Learning. Powered by Cognero. Page 10
Chapter 05 - The Measurement of Graphs
19. Determine which graph is nonplanar and indicate whether it contains a Utilities Graph or as a subgraph.
a. II is nonplanar; it contains
b. III is nonplanar; it contains
c. I is nonplanar; it contains a Utilities Graph
d. II is nonplanar; it contains a Utilities Graph
e. III is nonplanar; it contains a Utilities Graph
ANSWER: e
20. Determine which graph is nonplanar and indicate whether it contains a Utilities Graph or as a subgraph.
a. II is nonplanar; it contains
b. III is nonplanar; it contains
c. I is nonplanar; it contains
d. II is nonplanar; it contains a Utilities Graph
e. III is nonplanar; it contains a Utilities Graph
ANSWER: c
21. Determine which graph is nonplanar and indicate whether it contains a Utilities Graph or as a subgraph.
a. II is nonplanar; it contains
b. III is nonplanar; it contains
c. I is nonplanar; it contains a Utilities Graph
d. II is nonplanar; it contains
e. III is nonplanar; it contains a Utilities Graph
ANSWER: d
22. If a planar drawing of a graph has 12 edges and 8 vertices, how many faces does the graph have?
a. 20
b. 6
c. 32
d. 5
ANSWER: b
23. If a planar drawing of a graph has 7 vertices and 8 faces, how many edges does the graph have?
a. 16
b. 17
c. 33
d. 13
ANSWER: d
24. Determine (by trial and error) the chromatic number of the graph.
a. 4
b. 5
c. 7
d. 3
ANSWER: a