## Adv. Graph Theory – Final Exam Suggestion

April 2, 2013 Leave a comment

1. (a) Define with example:

Pseudo graph, complete graph ….

(b) Draw graph (Set of vertex & edges are given)

(c) Deleted sub-graph related math.

2. (a) Find adjacency for the following graph

(b) Draw graph whose adjacency matrix is given

(c) Definition

3. (a) Graph isomorphism. (Definition; Math)

4. (a) Explain with example

Planar graph, Degree of a region, Bipartite graph, Directed graph, etc.

(b) Determine whether the given walk in the following graph is (i) Path, (ii) a trail, (iii) a closed walk, (v) a circuit, (vi) a cycle.

5. State & prove Euler’s theorem. Verify theorem.

Math V-E+R=2

6. (a) If T is a tree with n vertices than it has precisely n-1 edges. (Theorem 3)

(b) Theorem 1

(c) Theorem 9

7. (a) Theorem 11

(b) Theorem 6