Villarama, Christian Michael A.

July, 2, 2020
GED102 - B4 Score:_____
EX4-CO3

a
1. Aiza, Chinchin, Angel, and Concon were good friends in high school. Although they enrolled in the same university in

vi
college, they took different majors. They, however, got to enroll in some common subjects. The table below shows their
enrolment history. An “X” indicates that the two students became classmates at least once. Draw a graph that represents this
information where each vertex represents a student and an edge connects two vertices if the corresponding students have

ed
become classmates at least once.

ar
Aiza Chinchin Angel Concon

sh
Aiza - X X
Chinchin X - X

as
Angel X - X

w
Concon X X -

m e
Answer:
co rc
o. ou
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 2. In their effort to improve the research culture among students and teachers, five universities in Metro Manila have agreed
to open their libraries for mutual utilization. The table below summarizes which university can use the library services of
another university. An “X” mark simply means that students and faculty of the involved universities can use both their library
services.

a
vi
University U1 U2 U3 U4 U5

ed
U1 - X X
U2 - X X

ar
U3 X X - X

sh
U4 X - X
U5 X X X -

as
a. Draw the graph according to the “X” marks in the table.

w
m e
co rc
o. ou
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 b. Which school is the most liberated when it comes to accepting students and faculty from other schools?
Answer: University 3 and 5 are the most liberated because they are permitted to use the facilities of 3 other
universities.
c. Which school is the least liberated?

a
Answer: The University 1, 2, and 4 are the least liberated universities since they can only use the facilities of 2 other

vi
universities.

ed
3. Five individuals met to discuss a new business venture. Before the meeting started, they shook hands with each other.

ar
The graph shows the handshakes that took place. An edge indicates that two persons shook hands before the meeting.

sh
as
w
m e
co rc
o. ou
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 a. Did JC and Dex shake hands?
Answer: According to the graph, they did not shake hands.
b. How many individuals did Prince shake hands with?
Answer: Based on the graph,Prince shook hands with JC, Jek, and Dex. Therefore, Prince shook hands with 3

a
individuals.

vi
c. Among the five individuals, who shook hands with the most people in the meeting?
Answer: Jek shook hands with 4 people, which makes him the person who shook hands with most people in the

ed
meeting.

ar
d. Would it make sense if the graph has a multiple edge?

sh
Answer: Yes, edge is known to join two vertices in a graph thus, multiple edge would interpret different interpretation
on the graph. Therefore, through observation it would result into a different solution and answer.

as
e. Would it make sense if the graph has a loop?
Answer: Loop in a graph is described to be as an edge in which connects a vertex to itself thus, loop in a graph has

w
a purpose and that is to start and at the same time end at the same vertex. So, in the graph given, it would make

m e
sense if the graph would be having a loop hence, it would interpret different interpretation that will result in various
co rc
solution and answers.
o. ou
4. For each graph given, do the following:
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 A. Determine the order and size of the graph.

Figure 1 Counts Figure 2 Counts

Order 7 Order 6

a
Size 10 Size 9

vi
ed
B. Tabulate the degree of the vertices.

ar
FIGURE 1 FIGURE 2

sh
Vertex Degrees Vertex Degrees

as
A 4 A 3
B 2 B 3

w
C 2 C 3

m e
D 3 D 5
co rc E 3 E 2
o. ou
F 3 F 2
G 3
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 C. Draw the graph in a different configuration.

FIGURE 1 FIGURE2

E E

a
C

vi
A
F
G

ed
A D C

ar
B

sh
B

as
F

w
m e
5. For each of the graphs given below, determine if:

co rc
a. Eulerian graph only, then specify a Eulerian circuit.
o. ou
b. Hamiltonian graph only, then specify a Hamiltonian cycle.
c. Neither Eulerian nor Hamiltonian, give justification
er res

ANSWERS:
eH y

For, FIGURE A
rs d

a. Figure A cannot be a Eulerian graph because some of its vertices does not possessed even numbers of degrees such as
stu

vertex E and B, which they have only 3 degrees each. Therefore, there will be no Eulerian Circuit.
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 b. Number of Orders/Vertices = 5 orders; Minimum number of degrees per vertex = 5 / 2 = 2.5 or 3
Therefore, Figure A can be a Hamiltonian graph since it has 5 orders and have met the minimum number of 3 degrees each
vertex.
Hamilton Cycle: D A B C E D

a
vi
For, FIGURE B
a. Figure B can be classified as Eulerian graph because all of its vertices have a even numbers of degrees that validate the

ed
Eulerian Graph Theorem.

ar
Eulerian Circuit: C A F D B G E A B C D E C

sh
b. Number of Orders/Vertices = 7 orders; Minimum number of degrees per vertex = 7 / 2 = 3.5 or 4
Therefore, Figure B can be also a Hamilton Graph since it has 7 orders and have met the minimum number or 3 degrees each

as
vertex. `
Hamilton Cycle: C A F D E G B C

w
m e
6. The graph below shows the pathways in a certain entertainment park. The head of the Janitorial and Sanitation Office is
co rc
designing a plan for the cleaning of the pathways.
o. ou
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 a. Is it possible to design a cleaning schedule such that all pathways will be cleaned, with the cleaning group passing through
a path way only once?
Yes, it is possible to design a cleaning schedule such that all pathways will be cleaned with the cleaning group passing
through a pathway only once because it does portray Eulerian graph since all of its vertices’ degrees are even numbers.

a
b. Design a cleaning schedule, if possible, based from a. such that starting from one point, the cleaning group will be able to

vi
clean all pathways and get back to the starting point.
Eulerian Circuit: H D A E F G A B I L K J D C H

ed
c. Design a cleaning schedule, if possible, based from a. such that starting from one point, the cleaning group will be able to

ar
clean all pathways this not necessarily be able to get to the starting point.

sh
Eulerian Trail: F G A B I L K J D C H D A E F → Not possible
It is not possible to design a cleaning schedule that will be able to clean all pathways with not necessarily be able to get to

as
the starting point because by doing so, we were not able to transverse all of the edges once.

w
7. A nursing house for senior citizens is designed as shown in the floor area diagram below. Four rooms are designated for

m e
regular and sickly male patients, and regular and sickly female patients. The floor plan of an art gallery is pictured below. Is it
co rc
possible for the nurse on duty to go through all the doors, passing through each door exactly once? If so, is it possible for the
o. ou
nurse to go back to the room where she came from?
er res
eH y
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
 Answers:
B

Graph

a
C D

vi
ed
A
E H I

ar
sh
G
F

as
w
m e
a. Number of Orders/Vertices = 10 orders; Minimum number of degrees per vertex = 10 / 2 = 5
co rc
Therefore, the graph that I have made can be classified as a Hamilton Graph since it met the conditions of where there should
o. ou
be at least 3 orders, which in our figure there is 10 orders. And all of these vertices have a minimum number of 5 which I
solved earlier.
er res

b. In this Hamilton Graph, yes, it is also possible for the nurse to go back to the room where she came from without having to
eH y

enter a door two or more times. The schedule or Hamilton Cycle that can make it possible is A, B, C E, F, J, G, D, H, I.
rs d
stu
is
Th

https://www.coursehero.com/file/64710513/E4-CO3-Villaramapdf/
Powered by TCPDF (www.tcpdf.org)