Practice Problems/Assignment

Manipal University Jaipur

School of Basic Science
Department of Mathematics and Statistics
Topic: Graph Theory
Assignment-2

Graphs
1. Find the degree of each vertex of the following graphs:

2. Determine the number of edges in a graph with 6 vertices, 2 of degree 4 and 4 of

degree 2. Draw two such graphs.
3. How many vertices are needed to construct a graph with 6 edges in which each vertex
is of degree 2?
4. It is possible to draw a simple graph with 4 vertices and 7 edges? Justify.
5. Find the in-degree and out degree of each vertex of the following digraphs

(i)
(ii)

Page 1 of 3
 Practice Problems/Assignment

6. Find the degree sequence of the following graphs:

(i) (ii)

7. Draw simple graph with the given degree sequence:

(i) (1, 1, 3, 3, 4, 4, 5) (ii) (3, 3, 3, 3, 3, 5, 5)
8. State and prove the Handshaking theorem.
9. Prove that the number of vertices of odd degrees in a graph is even.
10. Define isomorphism of two graphs.
11. What is meant by the following? Describe and give an example of each of them.
(i) Regular graph (ii) Complete graph
(iii) Bipartite graph (iv) Complete bipartite graph
12. In a given graph, define and give an example of each of the following:
(i) walk (ii) path (iii) circuit
13. Find the smallest positive integer for which the complete graph K n has at least 300

edges? 25
14. Draw graph which is
(i) Eulerian but not Hamiltonian

(ii) Hamiltonian but not Eulerian

Page 2 of 3
 Practice Problems/Assignment

(iii) Both Eulerian and Hamiltonian

(iv) neither Eulerian nor Hamiltonian

Page 3 of 3