For which of the following combinations of the degrees of vertices would the connected graph be eulerian?

Category: QuestionsFor which of the following combinations of the degrees of vertices would the connected graph be eulerian?
Editor">Editor Staff asked 4 weeks ago

For which of the following combinations of the degrees of vertices would the connected graph be eulerian?
 
(a) 1,2,3
 
(b) 2,3,4
 
(c) 2,4,5
 
(d) 1,3,5
 
I’m obligated to ask this question of Graph in chapter Graph of Data Structures & Algorithms I
 
This question was posed to me in my homework.

1 Answers
Editor">Editor Staff answered 4 weeks ago

Right option is (a) 1,2,3
 
Easiest explanation – A graph is eulerian if either all of its vertices are even or if only two of its vertices are odd.