Scribd
Upload
5 views3 pages

Tutorial Sheet-IV (Graph Theory)

The document is a tutorial sheet containing various questions related to graph theory, including definitions of different types of graphs, proofs of graph properties, and applications of algorithms like Dijkstra's. It covers topics such as Eulerian and Hamiltonian graphs, the Travelling Salesman Problem, and the Konigsberg Bridge Problem. Additionally, it includes problems that require proving properties of graphs and calculating paths and edges in specific scenarios.

Uploaded by

Shots Spots
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
5 views3 pages

Tutorial Sheet-IV (Graph Theory)

The document is a tutorial sheet containing various questions related to graph theory, including definitions of different types of graphs, proofs of graph properties, and applications of algorithms like Dijkstra's. It covers topics such as Eulerian and Hamiltonian graphs, the Travelling Salesman Problem, and the Konigsberg Bridge Problem. Additionally, it includes problems that require proving properties of graphs and calculating paths and edges in specific scenarios.

Uploaded by

Shots Spots
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/ 3

Tutorial sheet unit 4

Q1. Define the following terms with examples?

(i) Weighted graph (ii) Hamiltonian Graph (iii) Connected graph (iv) directed graph v) Eulerian
Graph vi) Complete bipartite graph

Q2. Prove that a simple graph with n- vertices and k- components can have at most (n-k) (n-k+1)/2
edges.

Q3. Define an Euler graph. Prove that a connected graph G is an Euler graph iff all the vertices of G
are of even degree.

Q4. Explain Konigsberg Bridge Problem with graph.

Q5. Prove that the number of edges in a complete graph with n- vertices is n(n-1)/2

Q6. Using Dijkstra’s algorithm, determine the shortest path between B to G in the given graph.

Q7. For any graph G with e- edges and n- vertices. Prove that ∑ d ( v i)= 2 e .
i= 1

Q8. Define a simple graph with example and show that the maximum number of edges in a simple
graph with n vertices is n(n-1)/2.

Q9. Give an example of a connected graph that has

(i) An Eulerian circuit but has not Hamiltonian Circuit

(ii) Both Hamiltonian Circuit and Euler Circuit.

(iii) Neither Hamiltonian Circuit nor Euler Circuit.


Q10. Find the shortest path between k and L in the graph by using Dijkstra’s Algorithm.

Q11. Define connected and disconnected graph.

Q12. Describe travelling sales man problem.

Q13. Define Planar graph and region of a graph. State and proof Euler formula’s for the graph.

Q14. Show that in a graph, the number of vertices of odd order is always even.

Q15. Show that in a planar graph there is one vertex with degree less than or equal to 5.

Q16. Show that K3, 3 is non-planar by Euler’s formula and K5 is also non-planar.

Q17. Explain Chinese postman problem.

Q18. Define directed and undirected graph and show that there is always a Hamiltonian path in a
directed complete graph.

Q19. Difference among Walk, trail, Path, Circuit and Cycle with the help of graph.

Q20. For vertices , , ..............., , prove that ∑ ≤ (∑ ) − ( − 1) 2 ∑ −

Q21. Consider a graph with 12 edges and n vertices. Six vertices are of degree 3 and the remaining
vertices have degree less than 3. Calculate the minimum number of vertices that such a graph can have.

Q22. At a recent math seminar, 9 mathematicians greeted each other by shaking hands. Is it possible
that each mathematician shook hands with exactly 7 people at the seminar?

Q23. If 10 people each shake hands with each other, how many handshakes took place? What does
this question have to do with graph theory?

Q24. Prove that any planar graph with v vertices and e edges satisfies
≤ 3 − 6.

Q25 All questions related to Travelling salesman problem and Chinese Postman problem.

Q26. A connected graph G is an Euler Graph if and only if it can be decomposed into circuits.

You might also like