Chapter 2 - Graph Theory

 

G is a bipartite graph with vertex partition:

U = {1,2,3,4,5,6}

V = {7,8,9}

Consider the projections of G onto the sets U and V and the following graphs. 

Select the alternative that contains only true statements:

A. The projection of G onto U is graphs II and IV.

B. By removing one edge from graph IV, it becomes the projection of G onto V.

C. The projection of G onto U is graph III.

D. The projection of G onto V is graph II.

E. None of the above.

Original idea by: Rodolfo Bitu