Generate KERALA UNIVERSITY Class 8 graph theory Question Paper

Create exam-ready question papers instantly using ZenQB AI. Perfect for teachers and students.

Sample Questions

In any graph G, show that the number of vertices with odd degree is even.
Show that a connected graph with $n$ vertices and $n-1$ edges is a tree.
Prove that any two simple connected graphs with $n$ vertices, all of degree two, are isomorphic.
Prove that every connected graph has at least one spanning tree.
What are the difficulties encountered in the theory of sequential machine? $$ \text { ( } 5 \times 4=20 \text { Marks) } $$ PART - B Answer any one questions from each Module. Each question carries ...