Name: Allyana Marie F.

Santos Date: May 30, 2022

Year/Course/Section: AB Political Science – 1A Professor: Mr. Nilo Jose Quintana

MATHEMATICS IN THE MODERN WORLD

ꟷ Final Examination ꟷ

I. Solve each of the following items completely. Draw a vertex edge graph.

1. The international flights offered by an airline company are shown below. Draw a
graph that represents this information, where each vertex represents a country,
and an edge connects two vertices if there is a direct flight between the
corresponding countries.

A B C

D F
 E
2. Draw a graph with five vertices in which:
a. Each vertex is of degree 2.

A B

E
C

D
b. Each vertex is of degree 4

A B

E C

D
c. One vertex is of degree 2, and four are of degree 3.

A B

C
 E
D
3. The diagram below shows the arrangement of a Habitrail cage for a pet hamster.
(Plastic tubes connect different cages.) Is it possible for a hamster to travel
through every tube without going through the same tube twice? If so, find a route
for the hamster to follow. Can the hamster return to its starting point without
repeating any tube passages? Explain why or why not.

Answer:

B
F E

G C

ꟷ Yes, it is possible for a hamster to travel through every tube without going
through the same tube and return to its starting point without repeating any tube
passages based on the illustration above. First, the hamster can start to the tube
C then make its way to the tube D and there the hamster should move downward
then proceed to tube G then make move upward to tube F turn right to tube E
and goes upward again to tube A from there the hamster should just follow the
 tube path that will led to tube B and end from where the hamster starts its way to
the tube C.

4. Draw a graph with six vertices in which each vertex is of degree 3 and that has:
a. Loops with no multiple edges

A
C

B E

F
D
b. Multiple edges but no loops
A

F B

E C

D
c. Neither loops nor multiple edges
A

F B

E C
 d. Both loops and multiple edges
AD
F
B

E
C
D
5. Given the graphs below, determine the number of edges in the graph, the
number vertices, the lowest and highest degrees, whether the graph is
connected, and whether graph is a complete graph.

a.
Number of edges: 6 edges
Number of vertices: 7 vertices
Lowest degree: 1 degree
Highest degree: 6 degree
Is graph connected? No, because some of the
vertices were disconnected to each other.
Is graph complete? No
b.
Number of edges: 6 edges
Number of vertices: 4 vertices
Lowest degree: 3 degree
Highest degree: 3 degree
Is graph connected? Yes, because the vertices are connected to any other
vertices.
Is graph complete? Yes