Centre of Data Sciences Assignment 1c)

ITER, Siksha 'O' Anusandhan Deemed to be University

Program B.Tech Semester I

Course IGT Course Code CSE 1004

1. Prove or disprove: If u and v are the only vertices of odd degree in a graph 6 , then G contains a u,
a-path.

2. Which of the following are graphic sequences? Provide a construction or a proof of impossibility
for each. a) (5,5,4,3,2,2,2,11, c) (5,5,5,3,2,2,1,11, b) (5,5,4,4,2,2,1,11, d) (5,5,5,4,2,1,1,11).

•••••

3. In a league with two divisions of 13 teams each, determine whether it is possible to schedule a
season with each team playing nine games against teams within its division and four games
against teams in the other division.
4. Describe a relation in the real world whose digraph has no cycles. Describe another that has cycles
but is not symmetric.
5. Prove that every u, r-walk in a digraph contains a u, r-path.
6. Prove or disprove: If D is an orientation of a simple graph with 10 vertices, then the vertices of D
cannot have distinct outdegrees.
7. Prove that there is an n-vertex tournament with indegree equal to outdegree at every vertex if and
only if n is odd.

• • • • •
8. For each n > 1, prove or disprove: Every simple digraph with n vertices has two vertices with the
same outdegree or two vertices with the same indegree.