# A triangular region formed by a hedge ab a part of a

This preview shows page 1. Sign up to view the full content.

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

Unformatted text preview: l 6 marks) 864. A graph G has adjacency matrix given by ABCDEF A 0 B 1 C 0 D 1 E 0 F 0 1 0 1 0 0 0 1 0 2 0 1 0 1 0 0 0 1 0 1 1 2 0 1 0 1 0 0 1 1 0 (a) Draw the graph G. (b) Explain why G has a Eulerian circuit. Find such a circuit. (c) Find a Hamiltonian path. (Total 6 marks) 589 865. The following diagram shows a weighted graph. Q 12 10 R S 5 4 2 P 5 4 3 4 7 T 10 W V 10 2 U Use Dijkstra’s Algorithm to find the length of the shortest path between the vertices P and T. Show all the steps used by the algorithm and write down the shortest path. (Total 8 marks) ∞ 866. Find the radius of convergence of the series ( 2k − 2)! ∑ k!(k − 1)!x k . k =1 (Total 5 marks) 590...
View Full Document

## This note was uploaded on 06/24/2013 for the course HISTORY exam taught by Professor Apple during the Fall '13 term at Berlin Brothersvalley Shs.

Ask a homework question - tutors are online