Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged hamiltonian-graph
1
votes
2
answers
1
UGC NET CSE | June 2014 | Part 2 | Question: 23
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$ $m = 2, n = 3$ $m = n > 2$ $m = n > 3$
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$$m = 2, n = 3$ $m = n 2$$m...
makhdoom ghaya
7.0k
views
makhdoom ghaya
asked
Jun 27, 2016
Graph Theory
ugcnetcse-june2014-paper2
graph-theory
hamiltonian-graph
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register