Which of the following statements about graph connectivity are true:

A. The necessary and sufficient conditions for G is connected: G has only one connected component.
B. The necessary and sufficient conditions for u and v are connected: u and v are in the same connected component.
C. If there are exactly two vertices of odd degrees in the graph, they are connected.
D. All the connected componentof a graph make up of one of its partitions.