Open In App

GATE | GATE-CS-2009 | Question 3

Like Article
Like
Save
Share
Report

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.


Answer: (B)

Explanation:

Since the graph is simple, there must not be any self loop and parallel edges. Since the graph is connected, the degree of any vertex cannot be 0. Therefore, degree of all vertices should be from 1 to n-1. So the degree of at least two vertices must be same.


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads