• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC-NET | UGC NET CS 2015 Dec - II | Question 2

Which of the following statement(s) is/are false ? (a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree. (b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree. (c) A complete graph (Kn) has a Hamilton Circuit whenever n ≥ 3. (d)A cycle over six vertices (C6) is not a bipartite graph but a complete graph over 3 vertices is bipartite. Codes:

(A)

(a) only

(B)

(b) and (c)

(C)

(c) only

(D)

(d) only

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments