Answer to Question #23189 in Discrete Mathematics for Sujata Roy

Question

Consider the collection of all undirected graphs with 10 nodes and 6 edges. Let M and m, respectively, be the
maximum and minimum number of connected components in any graph in the collection. If a graph has no selfloops and there is at most one edge between any pair of nodes, which of the following is true?
(A) M = 10, m = 10
(B) M = 10, m = 1
(C) M = 7, m = 4
(D) M = 6, m = 4
(E) M = 6, m = 3