edited by
2,067 views
3 votes
3 votes

For which values of $m$ and $n$ does the complete bipartite graph $k_{m,n}$ have a Hamiltonian circuit ?

  1. $m\neq n,\ \ m,n \geq 2$
  2. $m\neq n,\ \ m,n \geq 3$
  3. $m=n,\ \ m,n \geq 2$
  4. $m= n,\ \ m,n \geq 3$
edited by

2 Answers

0 votes
0 votes
Option D k2 there is no Hamiltonian circuit K3 onwards Hamiltonian circuit is possible K2 Hamiltonian path
Answer:

Related questions

7 votes
7 votes
1 answer
1
Arjun asked Jul 2, 2019
8,426 views
Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph?$6$$8$$12...
2 votes
2 votes
2 answers
4
Arjun asked Jul 2, 2019
7,063 views
How many ways are there to place $8$ indistinguishable balls into four distinguishable bins?$70$$165$$^8C_4$$^8P_4$