Analysis And Design Of Algorithms

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? Question 11 Not yet answered Marked out of 1.00 Select one: a. At least three vertices have the same degree. O b. All vertices have the same degree. O c. No two vertices have the same degree. O d. At least two vertices have the same degree. P Flag