ajuf.blogg.se

Which of the following simple graphs have a Hamilton Circuit or if no, a Hamilton Path?

Discuss different applications of graph in detail 8. Show that the ring-sum of any two cut-sets in a graph is either third cut-set or an edge disjoint union of cut-sets. Prove that graph G is disconnected if and only if its vertex set V can be partitioned into two nonempty subsets V1 and V2 such that there exists no edge in G whose one end vertex is in V1 and the other in V2 6.

Prove that a connected graph G is Eulerian if and only if all the vertices are of even degree with explanation 5. Give the explanation to prove that the following graphs G and H are not isomorphicĤ. In a complete graph having odd number of vertices, how many edge disjoint Hamiltonian circuits exist? Explain 3. Define the following with one example each (a) Infinite graph(b) Hamiltonian path (c) Component of a graph(d) Euler graph (e) Spanning subgraph (f) Arbitrarily traceable graph.

– Book Exercise and Example problems – Admin Unit 1 1. Anna University Exams Nov / Dec 2016 – Regulation 2013 Unique Important Questions – 7th Semester BE/BTECH CS6702 Graph Theory and Applications Important Message: Question paper Holds combination of Theory and problems, questions will be asked like the same model question below, Students are advised to study Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India, 2003.