Q777
An undirected graph has an eulerian cycle if and only if all the vertices have an odd degree.
A.
True
B.
False
AnswerAnswer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board