Anna University Chennai - Important Questions of CS6702 Graph Theory together with Applications
B.E/B.TECH DEGREE EXAMINATION NOV / DEC 2017
07th Semester
Department of Computer Science Engineering (CSE)
CS6702 Graph Theory together with Applications
November December 2017 Important Questions
(Regulation 2013)
CS6702 Graph Theory together with Applications - All Important 02 marks thirteen Marks together with 15Marks Questions are available below.
Unit 1:
1. Define key numbers for a consummate graph K5 (2 marks)
2. Show that a Hamiltonian path is a spanning tree. (2 marks)
3. Define a consummate graph (2 marks)
4. i) In a consummate graph having strange release of vertices, how many border disjoint Hamiltonian circuits exist? Explain (6)
ii) State the 2 theorems to banking concern tally if a connected graph G is Eulerian. Explain amongst proof (6)
iii) Find a path of length ix together with a circuit of length 8 inwards the Peterson graph (4)
5. i) Define isomorphism of graphs. Show that no 2 of the next iii graphs a shown inwards figure are isomorphic. (8 marks)
For Full Question Paper, Click Here to Download
B.E/B.TECH DEGREE EXAMINATION NOV / DEC 2017
07th Semester
Department of Computer Science Engineering (CSE)
CS6702 Graph Theory together with Applications
November December 2017 Important Questions
(Regulation 2013)
CS6702 Graph Theory together with Applications - All Important 02 marks thirteen Marks together with 15Marks Questions are available below.
Unit 1:
1. Define key numbers for a consummate graph K5 (2 marks)
2. Show that a Hamiltonian path is a spanning tree. (2 marks)
3. Define a consummate graph (2 marks)
4. i) In a consummate graph having strange release of vertices, how many border disjoint Hamiltonian circuits exist? Explain (6)
ii) State the 2 theorems to banking concern tally if a connected graph G is Eulerian. Explain amongst proof (6)
iii) Find a path of length ix together with a circuit of length 8 inwards the Peterson graph (4)
5. i) Define isomorphism of graphs. Show that no 2 of the next iii graphs a shown inwards figure are isomorphic. (8 marks)
For Full Question Paper, Click Here to Download
