Department of Mathematics

Indian Institute of Technology Madras

Course:MA2130-Graph Theory
Assignment Sheet-1.
1. Which of the following is a bipartite graph .

2. (a) How many vertices and how many edges are there in complete bipartite graphs K4,7
and K7,11 .
(b) If the graph Kr,12 has 72 edges, what is r ? 3. Suppose a graph has n ( 2) vertices.
Find the maximum number of edges which the graph can have.
4. Can there be a graph consisting of the vertices A, B, C, D with deg(A) = 2, deg(B) = 3,
deg(C) = 2, deg(D) = 2 ?
5. For a graph G = (V, E) what is the largest possible value for |V | if |E| = 19 and
deg(v) 4 for all v V ?.
6. Determine the order |V | of the graph G = (V, E) in the following cases (1) G is regular
with 15 edges. (2) G has 10 edges with 2 vertices of degree 4 and all others of degree 3.
7. Show that there is no graph with 12 vertices and 28 edges in the following cases : (a)
the degree of a vertex is either 3 or 4.
(b) the degree of a vertex is either 3 or 6.
8. Show that every simple graph must have at least two vertices of same degree.
9. Is there a simple graph with 1, 1, 3, 3, 3, 4, 6, 7 as the degree of its vertices ?.
10. For a graph with n vertices and m edges, if is the minimum and is the maximum
of the degrees of vertices, show that 2m/n .
11. Verify that the two graphs shown below are isomorphic

.
12. Show that the following graphs are not isomorphic :

.
13. Given a graph G1 , can there exist a graph G2 such that G1 is a subgraph of G2 but
not a spanning subgraph of G2 and yet G1 and G2 have the same number of edges.
14. Prove or disprove : complement of a bipartite graph need not be a bipartite graph.
15. Prove that two simple graphs G1 and G2 are isomorphic if and only if their complement
G1 and G2 are isomorphic.
16. For the graph G shown below , find G \ v and G \ e :

.
17. For the graph G and its subgraphs G1 and G2 shown below, find G1 and G2 :
2

18. Find the complement of the complete bipartite graph K3,3 .