DEPARTMENT OF MATHEMATICS

DIT UNIVERSITY, DEHRADUN

TUTORIAL – I
Graph Theory- (MA-317)

Q1. Differentiate between Eulerian and Hamiltonian graph with example.

Q2. Consider the graph G. Find the subgraphs obtained when each vertex is deleted.

Q3. Are the following graphs isomorphic?

S
Q5. n (n −1)
.
Show that the maximum number of edges in a simple graph with n vertices is 2
Q6. Show that a tree with n vertices has n − 1 edges.
Q7. Count the number V of vertices, the number E of edges and the number R of regions of each
map in fig .
Q8. Using Kruskal’s algorithm find the minimum spanning tree of the following graph.

Q9. Show that a connected graph G is a tree iff adding an edge between any two vertices in G
creates exactly one circuit.
Q10. Define Binary trees and show that number of vertices in a binary tree is always odd.S