Tutorial 6 - DCS5028 DISCRETE STRUCTURES TUTORIAL 6 CHAPTER...

• Lab Report
• 6
• 100% (1) 1 out of 1 people found this document helpful

This preview shows pages 1–6. Sign up to view the full content.

DCS5028 DISCRETE STRUCTURES TUTORIAL 6 1 CHAPTER 6: Graphs 1. Find a path of minimum length from v to w in the graph below that passes through each vertex exactly one time. a 4 2 8 3 6 d c b 5 6 4 9 e 12 (i) v = b, w = e (ii) v = c, w = d (iii) v = a, w = b 2. For questions (i-iii), tell whether the given path in the graph below is a simple path, a cycle and a simple cycle. (i) e, d, c, b (ii) a,d,c,d,e a b c d e

This preview has intentionally blurred sections. Sign up to view the full version.

DCS5028 DISCRETE STRUCTURES TUTORIAL 6 2 (iii)b,c,d,e,b,b 3. Find the degree of each vertex for the following graph 4. Decide whether the graphs below have an Euler Cycle. If yes, exhibit one. (i) (ii) v3 v6 v9 v1 v7 v4 v8 v10 v2 v5 v6 v3 v9 v1 v7 v4 v8 v10 v2 v5 v1 v2 v3 v4 v5
DCS5028 DISCRETE STRUCTURES TUTORIAL 6 3 5. Show that the graph below contains NO Hamiltonian Cycle. 6. Determine whether or not the graph below contains a Hamiltonian Cycle. If there is a Hamiltonian Cycle, exhibit it. Otherwise, give an argument that shows there is no

This preview has intentionally blurred sections. Sign up to view the full version.

This preview has intentionally blurred sections. Sign up to view the full version.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Hamiltonian Cycle. I. II. 7. Write the adjacency matrix and the incidence matrix for the graph below: a b d e c f g h i j a b c d e f g e 6 e 1 e 2 e 3 e 4 e 5 v 1 v 2 v 3 v 5 v 4 DCS5028 DISCRETE STRUCTURES TUTORIAL 6 4 I. II. 8. Draw the graph represented by the adjacency matrix below: a b c d e a 0 1 0 0 0 b 1 0 0 0 0 c 0 0 0 1 1 d 0 0 1 0 1 e 0 0 1 1 2 x1 a b x11 x2 x5 x4 c x3 g x6 d x7 x8 e x9 x10 f e7 e8 e2 e4 e1 e3 e5 e6 v2 v3 v4 v5 v1 v6 v7 DCS5028 DISCRETE STRUCTURES TUTORIAL 6 5 9. Prove that graphs G1 and G2 below are isomorphic. 10. Show that the graph below is planar by redrawing it so that no edges cross. I. II h i g f e d v u z y x w M N b a c e d c d a b e f DCS5028 DISCRETE STRUCTURES TUTORIAL 6 6 d a f e b 11. State whether the graph below is a bipartite graph. If the graph is bipartite, specify the disjoint vertex sets. I. II. v1 v2 v3 v4 v5 c...
View Full Document

• Spring '16
• NORIHAN BINTI HAMZAH
• Graph Theory, hamiltonian cycle, Graph theory objects, V engine, DCS5028 DISCRETE STRUCTURES

{[ snackBarMessage ]}

What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern