Name: Roll No.

Set A

1. For what values of n, the graph Kn is bipartite?

2. Find the number of vertices and edges in the complement of Km,n .

3. For what values of n, the graph Cn is a cycle?

4. Write down the adjacency matrix of the graph Km,n .

5. Draw a self-complementary simple graph with 4 vertices.

6. A sequence d = (d1 , d2 , . . . , dn ) is graphic if there is a simple undirected graph with degree sequence d. Is the
degree sequence (2, 3, 3, 4, 5, 6, 7) graphic? Justify.

7. Evaluate 4 3 2 ÷ − 5 × 4 2 × 5 ×3 ÷.

8. Define a strongly connected directed graph with example.

9. Give an example of a Hamiltonian Graph which is not Eulerian.

10. The vertices of a certain graph G have degrees 3, 4, 4, 4, 5, 6, 6. Prove that G is nonplanar.
 Name: Roll No. Set B

1. For what values of n, the graph Cn is bipartite?

2. Give an example of an Eulerian graph which is not Hamiltonian.

3. Find the number of vertices and edges in the complement of Kn .

4. For what values of n, the graph Wn is a cycle?

5. Define a weakly connected directed graph with example.

6. Write down the adjacency matrix of the graph Cn .

7. Draw a self-complementary simple graph with 5 vertices.

8. A sequence d = (d1 , d2 , . . . , dn ) is graphic if there is a simple undirected graph with degree sequence d. Is the
degree sequence (2, 3, 3, 4, 4, 5) graphic? Justify.

9. Evaluate 6 2 2 ÷ − 4 × 3 2 × 6 ×3 ÷.

10. By giving an example of a graph, show that converse of Dirac’s theorem is not true.

1
 Name: Roll No. Set C

1. For what values of n, the graph Qn is bipartite?

2. Find the number of vertices and edges in the complement of Cn .

3. For what values of n, the graph Kn is a cycle?

4. Write down the adjacency matrix of the graph Wn .

5. Draw a self-complementary simple graph with 6 vertices.

6. A sequence d = (d1 , d2 , . . . , dn ) is graphic if there is a simple undirected graph with degree sequence d. Is the
degree sequence (2, 3, 4, 4, 5) graphic? Justify.

7. Evaluate 7 2 2 ÷ − 3 × 3 3 × 6 ×4 ÷.

8. Define a unilaterally connected directed graph with example.

9. Give an example of a graph which is Hamiltonian as well as Eulerian.

10. The vertices of a certain graph G have degrees 3, 4, 4, 4, 5, 6, 6. Prove that G is nonplanar.

1
 Name: Roll No. Set D

1. For what values of n, the graph Wn is bipartite?

2. Find the number of vertices and edges in the complement of Qn .

3. For what values of n, the graph Qn is a cycle?

4. Write down the adjacency matrix of the graph Kn .

5. Draw a self-complementary simple graph with 7 vertices.

6. A sequence d = (d1 , d2 , . . . , dn ) is graphic if there is a simple undirected graph with degree sequence d. Is the
degree sequence (1, 3, 3, 3) graphic? Justify.

7. Evaluate 3 2 4 ÷ − 4 × 5 2 × 6 ×2 ÷.

8. Define a regular graph with example.

9. Give an example of a graph which is neither Hamiltonian nor Eulerian?

10. The vertices of a certain graph G have degrees 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7. Prove that G is nonplanar.

1
 Name: Roll No. Set E

1. For what values of n, the graph Cn is a cycle?

2. Find the number of vertices and edges in the complement of Kn .

3. Show that the statement ”If G is a 2-regular simple graph then G is a cycle” is false, by exhibiting an explicit
counterexample. What additional condition on G makes the statement true?

4. Give an example of a graph which is regular, connected on six vertices that is not complete.

5. Determine the values of m and n such that Km,n is Eulerian.

6. A sequence d = (d1 , d2 , . . . , dn ) is graphic if there is a simple undirected graph with degree sequence d. Is the
degree sequence (2, 2, 4) graphic? Justify.

7. Evaluate 8 2 3 ÷ − 4 × 6 2 × 6 ×3 ÷.

8. Define Homeomorphic graphs with example.

9. Show that there exists a 4 - regular planar graph and a 4 - regular nonplanar graph.

10. State Kuratowski’s Theorem. Explain by an example.

1
 Name: Roll No. Set F

1. Write down the adjacency matrix of the graph Wn .

2. Find the number of vertices and edges in the complement of Cn .

3. For what values of n, is the graph Kn Eulerian?

4. Give an example of a graph that is regular, but not complete, with each vertex having degree three.

5. Give an example of a graph that has an Euler circuit and Hamiltonian circuit that are not the same.

6. A sequence d = (d1 , d2 , . . . , dn ) is graphic if there is a simple undirected graph with degree sequence d. Is the
degree sequence (1, 3, 3, 4, 5, 6, 6) graphic? Justify.

7. Evaluate 6 2 4 ÷ − 3 × 5 4 × 9 ×2 ÷.

8. Define a planar graph with example.

9. By giving an example of a graph, show that converse of Ore’s theorem is not true.

10. The vertices of a certain graph G have degrees 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7. Prove that G is nonplanar.