Assignment IV - B.E.

III Semester Discrete Mathematics

Four students can submit one assignment 1. C.L.Liu Book: 4.6,4.14,4.23,4.24,4.28,4.29,4.30,4.31,4.35,4.49,4.50,4.51,4.53,4.55. 2. Prove that number of simple, labled graphs on n vertices is 2n(n1)/2 . 3. Prove that the number of vertices of odd degree in a graph is always even. 4. Write maximum number of edges in a simple graph with n-1 vertices. Prove that a simple graph with n-vertices must be connected if it has more than [(n 1)(n 2)]/2 edges. 5. Suppose that a connected graph G has 11 vertices and 53 edges. (a) Show that G is not Eulerian. 6. Is it possible to draw Graph with 6 vertices and degrees of vertices are in following sequence. If not why else draw the graph. (i) 6,5,4,3,2,1 (ii) 1,1,1,1,1,1 7. Can there be a regular graph with 5 vertices and 12 edges. 8. C.L.Liu Book: 5.2,5.3,5.25,5.26,5.27,5.28,5.29. 9. Prove following properties of the tree. 1. There is one and only one path between every pair of vertices in a tree, T. 2. A tree with n vertices has n-1 edges. 3. Any connected graph with n vertices and n-1 edges is a tree. 4. A graph is a tree if and only if it is minimally connected. 10. Suppose that a tree T with n vertices has only vertices of degree 1 and degree 3. Show that n must be even, and that T has exactly (n 2)/2 vertices of degree 3.