Manipal Entrance Test 2017 Math Paper

We know that Kn, 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 Kn is an Eulergraph if and only if n is odd.