Activity - Graph Theory PDF
Activity - Graph Theory PDF
Activity A
Graph Theory
Graph A Graph B
1.) Which of the following vertex sequence describe paths in the graph given above?
a.) STUVWXZY
b.) TVWZY
c.) STUS
d.) UYVTXZYU
e.) WVUSTVW
2.) Which paths in no.1 are closed paths? Cycles?
3.) From the graph above determine the vertex sequence of the shortest path connecting the following
pairs of vertex and give each length:
a.)S & Z
b.)S & V
c.) U & Y
D.) U & X
e.) V & W
4.) For each pair of vertex in no. 3 give the vertex sequence of the longest path connecting them that
repeat no edges. Is there a longest path connecting them?
5.) How many spanning trees are can be generated from its graph? Define 2 spanning trees of Graph A
and B.
6.) Which graph has and Euler path? Euler Circuit?(Use Fleury’s Algorithm) For those that don’t give an
explanation?
7.) Which graph contains Hamiltonian Path? Hamiltonian Circuit? For those that don’t give an
explanation?
B. Determine whether the following graphs are planar.
Graph 1 Graph 2
Activity B
Graph Theory
A. Suppose that the diagram below represents the floor plan for the ground of an art museum. Is it
possible to tour the exhibit on the first floor so that you pass through each door exactly
once?(Source: D.S.Malik and M.K. Sen) Support your answer.
B. The IT department is about to create a network to connect all the computer terminals in their
office. The floor plan is shown below:
The location of computer terminals are represented by the following capital letters and their respective
distances to their adjacent terminal is shown in the table below:
Adjacent Distance
Computers (in meters)
A&B 7
A&E 5
B&C 6
B&F 5
C&G 5
C&D 8
D&H 6
E&B 9
E&F 8
E&I 3
F&G 4
F&M 8
G&M 9
G&H 10
H&K 2
H&J 5
I&L 3
I&M 11
J&M 9
J&K 7
K&T 8
L&N 4
L&M 10
M&Q 5
M&R 7
M&S 10
N&O 6
N&Q 12
Q&R 7
R&S 8
S&T 10
Determine the minimum length of cable wire required in the construction of the network in their office.
How much will it cost the cable required if 1 meter of cable is 30 pesos?
C. Prepare a list of the names of your 10 friends and your common friends in Facebook. Construct a
graphical representation of your friend and your common friends. Prepare a matrix representation
of your constructed graph. Who among you has the most number of friends?
D. Using the Four Color Theorem, to color the different cities in NCR.