This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
This** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
**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