KERALA UNIVERSITY Class 8 graph theory Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

Find the number of vertices of a graph with 12 edges, where 6 vertices have degree 3 and other vertices have degree less than 3 . Draw the graphs.
Prove that in any undirected graph, the number of vertices of odd degree should be even.
If a connected graph G has n vertices, e edges and r regions, then prove that $n-e+r=2$.
(a) Prove that a simple graph with n vertices and k components can have at the most $\frac{(n-k)^{*}(n-k+1)}{2}$ edges.
(a) Write an algorithm to print the connected components of a graph. Analyze the complexity.