Manipal MET2017MathematicsMathematical Induction
For what values of n is the graph K_n Eulerian?
Options
- AOdd values of n
- BEven values of n
- CBoth odd and even values of n
- DNone of the above
Correct answer
A. Odd values of n
Step-by-step solution
We know that K_n , the complete graph of n vertices is a connected graph in which degree of each vertex is n-1 . Since, a graph is Eulerian if and only if it is connected and degree of each vertex is even, we conclude that K_n is an Euler graph if and only if n is odd.