Tuesday, October 31, 2017

CS6702 Graph Theory and Applications Nov Dec 2017 Important Questions

Anna University Chennai - Important Questions of CS6702 Graph Theory and Applications
B.E/B.TECH DEGREE EXAMINATION NOV / DEC 2017
07th Semester
Department of Computer Science Engineering (CSE)
CS6702 Graph Theory and Applications
Nov Dec 2017 Important Questions
(Regulation 2013)

CS6702 Graph Theory and Applications - All Important 02 marks 13 Marks and 15Marks Questions are available below.

Unit 1:
1. Define fundamental numbers for a complete graph K5 (2 marks)
2. Show that a Hamiltonian path is a spanning tree. (2 marks)
3. Define a complete graph (2 marks)
4. i) In a complete graph having odd number of vertices, how many edge disjoint Hamiltonian circuits exist? Explain (6)
ii) State the two theorems to check if a connected graph G is Eulerian. Explain with proof (6)
iii) Find a path of length 9 and a circuit of length 8 in the Peterson graph (4)
5. i) Define isomorphism of graphs. Show that no two of the following three graphs a shown in figure are isomorphic. (8 marks)
For Full Question Paper, Click Here to Download

Duraimani

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!