This action might not be possible to undo. Are you sure you want to continue?
Harshit Kumar June 1, 2012
Determine whether the following graph has (a) an Euler circuit or Euler path (b) a Hamilton circuit or Hamilton path. 3. (hint: We are able to count the number of walks of a given length k by calculating the k th power of the adjacency matrix and reading its elements) 4. Determine whether the following digraphs are isomorphic. 2. Determine whether the following graph has (a) an Euler circuit or Euler path (b) a Hamilton circuit or Hamilton path. Determine whether the following graphs are isomorphic. 5.1. Use powers of the adjacency matrix to ﬁnd the following numbers of paths in this graph. : (a) paths from b to e of length 3 (b) paths from a to c of length 5 (c) paths from d to b of length 6. 1 .
the second number gives the time (in minutes) that it takes the mail carrier to walk along that street without delivering mail. McGraw-Hill. What is the minimum total length of time required to start from point A. and return to A? Note: A further discussion of this problem and similar ones can be found in Chapter 20 of Applications of Discrete Mathematics. 8. Inorder b. 12. J. The Chinese Postman Problem: The following graph shows the streets along which a mail carrier must deliver mail. 11.. 3. 5 (in clockwise order) and each edge is assigned a weight equal to the sum of the labels on the endpoints of the edge. Michaels and K. 6. Each street segment has a label consisting of two numbers: the ﬁrst number gives the time (in minutes) that it takes for the mail carrier to deliver mail along that street. 14. Preorder c. Use the Kruskal’s to ﬁnd a spanning for the following graph. For the following binary tree. print the output for the a. 10. 2. complete mail delivery along all the streets in the map.6. Suppose the vertices of K5 are numbered 1. Construct a binary tree from the following preorder and inorder sequence Inorder sequence: D B E A F C Preorder sequence: A B D E C F 2 . Find a spanning tree of minimum weight for this graph. 18 11. 9. 7. G. 1991. 4. 5. Postorder 10. 4. 3. 9. 7. as in the following gure. Construct a binary search for the following data 13. 1. Rosen eds. 8. 2. H.