UGC NET Computer Science Paper 2 December 2015 2 Which of the following statements isare false
The eduladder is a community of students, teachers and programmers just interested to make you to pass any exams. Because we believe that you can do more than that of just passing exams. What else we do?
Our team
Wondering how this works?
Want to pass exams? or want to help students to pass?

Ask a Question

You are here:-->View note-->View question

UGC NET Computer Science Paper-2 December 2015 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 


By:scribed

Taged users:
|Osho-meditation-center-banglore-nisarga|sojan|neha|Brian|binojames|OSHO-books|jinsnjjose|sumesh|metaphor|vishwadeep|Beingsrt|manjarimattur|neenu2|Amitnb|scribed|electron|

Likes:
Be first to like this question

Dislikes:
Be first to dislike this question
Talk about thisDelete|Like|Dislike|


Answers

D is the correct answer

electron

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about thisOnce you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

You dont have permission to add an answer herePlease see this

Join us to pass any exams easily