  In this paper, we study the parameterized complexity and inapproximability of
the {\sc Induced Matching} problem in hamiltonian bipartite graphs. We show
that, given a hamiltonian cycle in a hamiltonian bipartite graph, the problem
is W[1]-hard and cannot be solved in time $n^{o(k^{\frac{1}{2}})}$ unless
W[1]=FPT, where $n$ is the number of vertices in the graph. In addition, we
show that unless NP=P, the maximum induced matching in a hamiltonian graph
cannot be approximated within a ratio of $n^{1-\epsilon}$, where $n$ is the
number of vertices in the graph. For a bipartite hamiltonian graph in $n$
vertices, it is NP-hard to approximate its maximum induced matching based on a
hamiltonian cycle of the graph within a ratio of $n^{\frac{1}{4}-\epsilon}$,
where $n$ is the number of vertices in the graph and $\epsilon$ is any positive
constant.
