The GATE Grind

GATE 2009 CS – Question 3

Engineering Mathematics · Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) · 1 mark · Multiple choice

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?

  1. No two vertices have the same degree.
  2. At least two vertices have the same degree.
  3. At least three vertices have the same degree.
  4. All vertices have the same degree.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) At least two vertices have the same degree.

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions

All Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions →