NOIDA INSTITUTE OF ENGINEERING AND TECHNOLOGY

THIRD SESSIONAL TEST

ODD SEMESTER(2014)
B. Tech. V Semester
Branch: CSE Section: A+B+C+D
Subject: Graph Theory Paper Code: ECS-505
Time: 1:30 HRS. Maximum Marks:
30
SECTION – A
Attempt any five questions: (5*2=10)
1. A simple graph G is 2-connected if and only if for every triple (x, y, z) of distinct vertices, G
has an x, z – path through y. Prove it.
2. Prove or disprove: In any colouring of a line graph, each point is adjacent with at most two
points of the same colour.
3. Prove: The vertex connectivity and line connectivity are equal in 3 – regular graphs.
4. Define vector space of graph and cut set subspace of connected graph. What is meant by
dimension of a subspace?
5. Differentiate between incidence and adjacency matrices.
6. State the four colour problem. Are there graphs that cannot be coloured with four colours?

SECTION – B
Attempt any two questions: (2*5=10)
1. What do you understand by network flows? Explain relation between network flows and cut
vertices in simple unweighted graphs.
2. Define a separable graph. Prove that in a non-separable graph G set of edges incident on each
vertex of G is a cut set.
3. Define thickness and crossing number of a graph. Find thickness and crossing number of the
graphs K5 and K3,3.
SECTION – C
Attempt any two questions: (2*5=10)
1. Define a circuit vector and a cut set vector of a connected graph. Prove that a circuit vector
and a cut set vector are orthogonal to each other with respect to mod 2 arithmetic.
2. Define the chromatic polynomial of a graph. Find the chromatic polynomial of the graph
given below:

3. Explain the following with suitable example:

a. Partitioning b. Covering c. Matching