Which one of the following is TRUE for any simple connected undirected graph…
GATE · 2009 · CS
Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?
- A.
No two vertices have the same degree.
- B.
At least two vertices have the same degree.
- C.
At least three vertices have the same degree.
- D.
All vertices have the same degree.
Attempted by 553 students.
Sign up free to check your answer
Sign up freeLoading lesson…