Scribd
Upload
3K views4 pages

Midterm1st Act Quiz G3

1) The document discusses a midterm activity and quiz for a mathematics group. It provides examples of graph theory questions involving transportation routes, social networks, and garbage collection routes. 2) It asks students to determine properties of graphs like whether they are Eulerian, contain Euler circuits/paths, and to find shortest paths for garbage collection. 3) Examples are provided of analyzing graphs to determine their number of edges, vertices, connectedness, and whether they are complete graphs or have vertices of odd degree.

Uploaded by

Jarwin Aburan
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
3K views4 pages

Midterm1st Act Quiz G3

1) The document discusses a midterm activity and quiz for a mathematics group. It provides examples of graph theory questions involving transportation routes, social networks, and garbage collection routes. 2) It asks students to determine properties of graphs like whether they are Eulerian, contain Euler circuits/paths, and to find shortest paths for garbage collection. 3) Examples are provided of analyzing graphs to determine their number of edges, vertices, connectedness, and whether they are complete graphs or have vertices of odd degree.

Uploaded by

Jarwin Aburan
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

MATHEMATICS IN THE MODERN WORLD 9/17/2021

MIDTERM ACTIVITY FIRST QUIZ


GROUP 3
GROUP MEMBERS: CN: 2003
ABURAN, JARWIN
DATOR, NIGEL JAMES
ESQUIERDA, ANGEL ROSE
DELA CRUZ, KIM HARIZON

Exercises 6.1
1. Transportation. An “X” in the table below indicates a direct train route between the corresponding
cities. Draw a graph that represents this information, in which each vertex represents a city and an
edge connects two vertices if there is a train routes between the corresponding cities.

Graph

3. Social Network. A group of friend is represented by the graph


at the left. An edge connecting two names means that the two
friends have spoken to each other in the last week.
a. Have John and Stacey talk to each other last week?
No, they didn’t talk to each other last week.
b. How many of the friends in this group has Steve talked to in
this last week?
Three friends from the group.
c. Among this group of friends, who has talked to the most
people in the last week?
Ada talked to most people.

d. Why would it not make sense for this graph to contain a


loop?
Because they are not talking to theirselfves alone.

In Exercises 15 to 22, (a) determine whether the graph is Eulerian. If it is, find a euler circuit. If
its not, explain why. (b) If the graph does not have a euler circuit, does it have an Euler path? If so,
find one. If not, explain why.

15.
a. The graph is eulerian, because all the vertices are in even degree.
b. It has a Euler circuit because it stars and ends at the same vertex.

17.
a. Its not Eulerian, because all the vertices have odd degree.
b. it contains a euler path, because it starts and ends at different
vertices.

19.
a. Its not Eulerian, because all the vertices have odd degree.
b. it contains a euler path, because it starts and ends at different
vertices.
21.
a. The graph is eulerian, because all the vertices are in even degree.
b. it does not contain Euler circuit, because it starts and ends at
different vertices.

In Exercises 5 to 8, determine (a) the number of edges in the graph, (b) the number of vertices
in the graph, (c) the number of vertices that are odd degree, (d) whether the graph is connected, and
(e) whether the graph is a complete graph.

5.
a. 6 edges
b. 7 vertices
c. 5 vertices that are odd degree
d. Its not connected
e. Its not complete Graph

7.
a. 6 edges
b. 4 vertices
c. 3 vertices that are odd degree
d. It is connected
e. It is a complete graph

5. A garbage collector would like to collect the garbage in all the street of a subdivision among the
shortest possible path. Is this an Eulerian or Hamiltonian problem? Explain why?
The problem is Eulerian, because the garbage collector only passed once the subdivisions.
7. Below is the map of street in a subdivision. A garbage collector would like to collect the garbage of
residents along a shortest possible path.
A. Is it a possible for the garbage collector to find the most efficient route to collect all the garbage
with no street to be traversed more than once
Yes, as we can see in the graph that is a complete graph which is all edges are connected
once another.
8. Determine whether the graph is Hamiltonian. If it is, find a Hamiltonian circuit. If is not, explain why

A.
The graph is Hamiltonian, because base on the Diracts theorem if the vertex is 3 it is an Hamiltoninan.

You might also like