CS60047: Advanced Graph Theory

Class Test I (out of 10 marks)

(Timing: 9:30 to 10:25, 03 Sep, 2015)

ROLL NO:

NAME:

Instructions, some notations . . .

Unless mentioned explicitly, all graphs that we consider here are undirected, simple, and finite.
(G) denotes the size of a maximum independent set in G; (G) denotes the size of a maximum
vertex cover in G; 0 (G) denotes the size of a maximum matching in G; V (G) and E(G) denote
the vertex set and the edge set of G, respectively; q(G) denotes the number of odd components
in G; Cn denotes a cycle on n vertices.

Problems
5 1 = 5 marks

1. TRUE or FALSE?
(a) For a bipartite graph G, (G) + 0 (G) = |V (G)|.
(b) There exist bridgeless cubic graphs with no perfect matching.
(c) Every k-regular bipartite graph has a perfect matching (assume k 1).
(d) In a C6 , there exists a maximal matching of size 2.

(e) S is a minimum vertex cover in G = S is a minimal vertex cover in G.

ROUGH WORK

2. A tree T has a perfect matching if and only if q(T v) = 1, for every vertex v V (T ).
5 marks

ROUGH WORK