COE128 LONG QUIZ NO.

3
INSTRUCTIONS:
No erasures.
Use black or blue ink for your final answer and solutions.
Submission on Dec. 15, 2014 (Monday) between 10am-5pm @ EECE Consultation Room (N205B)
2nd Floor North Building.
I.

Relations and Functions

Give one practical application related in your field where the special types of relations and
functions are being used.

II.

Graph Theory
A. For the given graph, find:

1)
2)
3)
4)
5)
6)

the number of edges (show your solution)

a path of length seven
a trail of length eleven
a cycle of size nine
a circuit of size seven
an induced subgraph determined by the set of vertices {G, F, D, E, B,C}
(draw the graph)
7) a Hamiltonian path/cycle, if any exists
8) an Euler trail/circuit, if any exists
B. Given these two graphs G1= (V1, E1) and G2= (V2, E2), prove that there is an isomorphism.
Draw the graphs. Show your solution.

V1 a, b, c, d , e
V2 1,2,3,4,5

E1 a, b , a, c , a, d , b, d , b, e, c, e
E2 1,2, 1,5, 2,3, 2,4, 3,4, 4,5

The fear of the Lord is the beginning of wisdom. Proverbs 9:10a