UGC NET CS 2010 Dec-Paper-2
October 11, 2023UGC NET CS 2010 Dec-Paper-2
October 11, 2023UGC NET CS 2010 Dec-Paper-2
| Question 2 |
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are
| all of even degree | |
| all of odd degree | |
| of any degree | |
| even in number |
Question 2 Explanation:
→ An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices all of even degree.
→ Eulerian circuit (or) Euler tour in an undirected graph is a cycle that uses each edge exactly once.
→ Eulerian circuit (or) Euler tour in an undirected graph is a cycle that uses each edge exactly once.
Correct Answer: A
Question 2 Explanation:
→ An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices all of even degree.
→ Eulerian circuit (or) Euler tour in an undirected graph is a cycle that uses each edge exactly once.
→ Eulerian circuit (or) Euler tour in an undirected graph is a cycle that uses each edge exactly once.