Scribd
Upload
11 views

DM&GT PRACTICE PROBLEMS unit-4 & 5

The document covers various topics in graph theory, including properties of vertices and edges, degrees of vertices, isomorphism, Hamiltonian cycles, Euler circuits, and algorithms for bipartite graphs and spanning trees. It also discusses graph representation methods, planar graphs, graph coloring problems, and specific algorithms like Kruskal's and Prim's for finding minimal spanning trees. Additionally, it includes exercises and proofs related to these concepts.

Uploaded by

bhanu.kodeboina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

DM&GT PRACTICE PROBLEMS unit-4 & 5

The document covers various topics in graph theory, including properties of vertices and edges, degrees of vertices, isomorphism, Hamiltonian cycles, Euler circuits, and algorithms for bipartite graphs and spanning trees. It also discusses graph representation methods, planar graphs, graph coloring problems, and specific algorithms like Kruskal's and Prim's for finding minimal spanning trees. Additionally, it includes exercises and proofs related to these concepts.

Uploaded by

bhanu.kodeboina
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT-IV

GRAPH THEORY
1. Find the number of vertices, the number of edges, and the degree of each vertexin the given undirected

graph. Identify all isolated and pendant vertices.

2. What are the degrees and what are the neighbourhoods of the vertices in the graphs G and H?

3. Find the in-degree and out-degree of each vertex in the graph G with directededges

4. Show that the number of odd degree vertices in a graph is always even.
5. Let G be the non-directed graph of order 9 such that each vertex has degree 5 or 6. Prove that atleast 5 vertices
have degree 6 or at least 6 vertices have degree 5.
6. Show that a simple complete digraph with n nodes has the maximum number of Edges n (n-1). Assuming
that there are no loops.
7. How many edges does a graph have if it has vertices of degree 4,3,3,2,2? Drawsuch a graph.
8. Prove that a simple graph with n vertices and k components can have at most (n - k)(n – k + 1) edges
9. Determine the number of edges in: i) Kn ii) Km,n iii) Pn.
10. Explain isomorphism of two graphs with suitable example
11. Determine whether the given pair of graphs is isomorphic.

1
12. How a graph can be represented using adjacency matrix and incidence matrix? Give examples and pros & cons of
each method
13. Draw the graphs of the following matrices.

1 0 0 1 1 0 01
0 0 
1 1 0 1 0 0 
Adjacency matrix A=  and Incidence matrix I = 
0 1 1 1 1 0 11
   
1 1 1 0 0 1 1 0

14. What is a Hamiltonian Cycle? Draw bipartite graph K3,4 and prove that this graph does not have a Hamiltonian cycle.
15. Explain Hamiltonian cycle and Euler circuit with suitable example also draw (i) a graph which has an Euler circuit but
no Hamiltonian cycle and (ii)a graph with Hamiltonian cycle but no Euler circuit.
16. Discuss the similarities and dissimilarities between Eulerian and Hamiltoniangraphs.
17. Give an example of graph which contains
(i) an Eulerian Circuit and a Hamiltonian cycle
(ii) neither a Hamiltonian cycle nor an Eulerian Circuit
(iii) a Hamiltonian cycle but not an Eulerian Circuit
(iv) an Eulerian Circuit but not a Hamiltonian cycle
18. Show that the following graph G5 & G6 has no Hamiltonian cycle.

2
UNIT-V
MULTI GRAPHS
1. Describe an algorithm to decide whether a graph is bipartite or not
2. Are the graphs G and H bipartite

3. Show that the complete bi-partite graph K3, 3 is not a planar graph.
4. Prove that complete graph of 5 vertices is non-planar.
5. In any planar graph, show that |V|–|E|+R|=2 with suitable example
6. State and explain graph coloring problem. Give its applications
7. Explain in brief about Four color problem.
8. What is the chromatic number of the following graphs i)C n ii) Kn iii) K m,n iv) tree with n vertices
9. Define Chromatic number. What is the chromatic number of the following graphs

10. Write short notes on DFS and BFS.


11. Write an algorithm for breadth-first search spanning tree.
12. Trace the DFS algorithm with a case study.
13. Explain kruskal’s algorithm to find minimal spanning tree of the graph with suitable example?
14. Find all spanning tree of the following Graph.

15. Use depth-first search to find a spanning tree for the graphs.

3
16. Use breadth-first search to find a spanning tree for the graph.

17. Construct the minimal cost spanning tree for the cities shown in following graph using krushkals algorithm?

18. Construct the minimal cost spanning tree for the cities shown in below graphs using Prim’s algorithm?

19. Illustrate the difference between Prim’s and Kruskal’s algorithm with suitable example.
20. Find a minimal spanning tree for the following graph.

You might also like