Consider a complete bipartite graph kₘ,ₙ. For which values of m and n does this, complete graph have a Hamilton circuit
Show answerHide answer
Correct answer: (C) m = n ≥ 2
Explanation
Kₘ,ₙ is Hamilton circuit if and only if m = n ≥ 2, (Circuit is a path similar to a cycle that starts and ends at the same vertex) and Kₘ,ₙ is a Hamilton circuit if m = n ≥ 2, so the correct answer is (c).