Scribd
Upload
71 views4 pages

Page 1 of 4

This document provides information and instructions for an examination on the topic of Graph Theory. It consists of 5 questions, with each question having 4 parts (A, B, C, D). Question 1A asks for an example of a complete bipartite graph. Students must attempt all questions, with Question 1A being compulsory and carrying 4 marks, and they must attempt 2 parts from B, C, and D carrying 8 marks each. The exam allows 3 hours and is out of a maximum of 100 marks with a minimum passing score of 35 marks.

Uploaded by

Vicky Ratnakar
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
71 views4 pages

Page 1 of 4

This document provides information and instructions for an examination on the topic of Graph Theory. It consists of 5 questions, with each question having 4 parts (A, B, C, D). Question 1A asks for an example of a complete bipartite graph. Students must attempt all questions, with Question 1A being compulsory and carrying 4 marks, and they must attempt 2 parts from B, C, and D carrying 8 marks each. The exam allows 3 hours and is out of a maximum of 100 marks with a minimum passing score of 35 marks.

Uploaded by

Vicky Ratnakar
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

102621CS

Roll No………………………..
Course Code: 102621CS
Examination: APRIL-MAY 2023
Course: GRAPH THEORY

Time Allowed: 3 Hours Maximum Marks: 100


Minimum Marks: 35
Note: Attempt all questions. Part (A) of each question is
compulsory and carries 4 marks; attempt any two parts from part
(B), (C) and (D) carrying 8 marks each.
Q1 A Give an example of a complete bipartite graph. 4
B Explain the difference between Walk, Path and 8
Circuit in a graph with example.
C Explain the term “Connected Graph” with an 8
example. Give applications of graph connectivity
from engineering and real-life problems.
D Explain Graph Isomorphism with an example. 8
Q2 A Calculate and label indegree and outdegree for the 4
vertices of the given graph?

Page 1 of 4
102621CS

B Explain about directed graphs and their types? Give 8


some applications of directed graphs.
C Explain Hamiltonian Paths and Hamiltonian 8
Circuits with their applications.
D Explain the Traveling Salesman Problem with an 8
example case.
Q3 A The adjacency matrix of any undirected graph is 4
symmetric. Justify this statement with an example.
B Find the shortest path from Node 0 to Node 4 using 8
Djjkstra’s algorithm for the following graph

C Calculate the minimum spanning tree for the graph. 8

Page 2 of 4
102621CS

D Apply Floyd Warshall algorithm on the following 8


graph.

Q4 A Give an example of a cut set and cut vertices for a 4


graph.
B What are planar graphs? Give examples of planar 8
and non- planar graphs.
C Explain about Geometrical dual of graph giving an 8
example. Draw the original graph and its geometric
dual.
D State and prove Euler’s theorem. 8
Q5 A Calculate the chromatic number of the complete 4
graph with 4 vertices.
B What are the applications of graph centrality 8
measures?
C Explain the 4-color and 5-color problem. 8

Page 3 of 4
102621CS

D Solve Eigen centrality for the given graph? 8

Page 4 of 4

You might also like