A given connected graph is a Euler Graph if and only if all vertices of are of

2016

A given connected graph is a Euler Graph if and only if all vertices of are of

Answer: B. even degree — A connected graph is an Euler Graph if and only if every vertex has an even degree. This condition ensures that for every entry into a vertex, there is a…

  1. A.

    same degree

  2. B.

    even degree

  3. C.

    odd degree

  4. D.

    different degree

Attempted by 344 students.

Show answer & explanation

Correct answer: B

A connected graph is an Euler Graph if and only if every vertex has an even degree. This condition ensures that for every entry into a vertex, there is a corresponding exit, allowing the traversal of all edges exactly once.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…