Scribd
Upload
30 views2 pages

Iind Year Mca Graph Theory: Data, The Same May Be Assumed and State The Assumption Made in The Answer

This document outlines the exam structure for a Graph Theory course, including various questions covering topics such as walks, trails, Euler's formula, trees, Eulerian graphs, and operations on graphs. Students are required to attempt all questions, with specific parts focusing on definitions, properties, and applications of graph theory concepts. The exam consists of multiple sections, each with a mix of short answer and detailed explanation questions.

Uploaded by

rs22082001
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
30 views2 pages

Iind Year Mca Graph Theory: Data, The Same May Be Assumed and State The Assumption Made in The Answer

This document outlines the exam structure for a Graph Theory course, including various questions covering topics such as walks, trails, Euler's formula, trees, Eulerian graphs, and operations on graphs. Students are required to attempt all questions, with specific parts focusing on definitions, properties, and applications of graph theory concepts. The exam consists of multiple sections, each with a mix of short answer and detailed explanation questions.

Uploaded by

rs22082001
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/ 2

Sub Code: CAT-014 ROLL NO……………..……………..

III SEMESTER EXAMINATION, 2023 – 24


IInd Year MCA
GRAPH THEORY

Duration: 3:00 hrs Max Marks: 100


Note: - Attempt all questions. All Questions carry equal marks. In case of any ambiguity or missing
data, the same may be assumed and state the assumption made in the answer.

Q 1. Answer any four parts of the following. 5x4=20


a) Differentiate between walks, trails, paths, and circuits in a graph with suitable
example.
b) Discuss enumeration techniques in graph theory and different types of
enumeration problems.
c) Explain Euler's formula and its corollaries in the context of planar graphs.
d) Explore additional criteria for determining planarity in graphs.
e) Discuss the relationship between spanning trees and fundamental circuits.
f) How does the circuit matrix relate to the incidence matrix, and what information
does it provide about the graph?
Q 2. Answer any four parts of the following. 5x4=20
a) Define a tree in graph theory and explain its fundamental properties.
b) What are Eulerian graphs, and what properties do they possess? Provide an
example of finding an Eulerian circuit in a given graph.
c) Define thickness and discuss how the number of crossings in a graph is related to
its planarity.
d) Discuss how the cut set matrix is derived from the incidence matrix with suitable
example.
e) State the rank-nullity theorem and its implications in the context of matrices
associated with graphs.
f) What are the cut sets and cut vertices in a graph? Explain how cut sets and cut
vertices contribute to the concept of connectivity in a graph.

Q 3. Answer any two parts of the following. 10x2= 20


a) Discuss various operations that can be performed on graphs, such as union,
intersection, and complement and Provide examples of how these operations can be
applied to solve graph-related problems.
b) Discuss how Kuratowski's theorem can be applied to detect planarity in graphs.
c) Provide a step-by-step explanation of how to count labeled trees with n vertices.
Q 4. Answer any two parts of the following. 10x2= 20
a) Explain Hamiltonian paths and circuits in a graph. Discuss types of directed
graphs, such as strongly connected and weakly connected digraphs, and their
implications.
b) Find the minimum spanning tree using Kruskal's algorithm and Prim's algorithm
given below graph.

c) Explain the concepts of combinatorial and geometric duals of a planar graph and
Discuss the relationship between a graph and its duals.
Q 5. Answer any two parts of the following. 10x2= 20
a) Finding the shortest path to travel from a to z in a weighted graph using
Dijkstra's algorithm.

b) Explain the working of network flows in a graph. Discuss applications of network


flows and their relevance in various real-world scenarios with the help of suitable
example.
c) Find the path matrix for given below graph.

**********

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy