DEPARTMENT OF MATHEMATICS

DIT UNIVERSITY, DEHRADUN

Assignment – I
Graph Theory- (MA-317)

Q1. Define the following terms

a) Fundamental circuit
b) Fundamental cutest
c) Seperable Graph
d) Disconnected graph
Q2. Show that the edge connectivity of a graph G cannot exceed the degree of vertex with the
smallest degree in G.
Prove that a connected planar graph with n vertices and e edges has e − n + 2 regions.
Q3.
Q4. Differentiate between self dual graphs and combinatorial dual graphs with suitable examples.
Q5. Draw planar representation of each graph G if possible, otherwise show that it has a subgraph
homeomorphic to
K 5 or K 3 3 .

Q6. Find the incidence matrix to represent the graph shown below

Q7. Draw the graph represented by the following adjacency matrices:

[ ]
0 1 0 1 0

[ ]
0 1 0 0 1 0 1 0 1
0 1 1 0 0 1 0 1 1
0 1 1 1 1 0 1 0 0
1 0 0 0 0 1 1 0 0
a) b)
Q8. Find the minimal spanning tree of the weighted graph given below using Prim’s algorithm:

[ ]
Q9. Draw the graph represented by the incidence matrix given below:
1 0 0 0 0 1
0 1 1 0 1 0
1 0 0 1 0 0
0 1 0 1 0 0
0 1 0 1 0 0
0 0 1 0 1 1

Q10. In the following graphs, determine the a) vertex set and b) edge set.