GeeksforGeeks » Miscellaneous
A GATE 2009 question about graph
(2 posts)-
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. -
Option B
Reply
You must log in to post.
