Yen-Neng Peng

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The problem of whether or not there are mutually independent hamiltonian cycles in interconnection networks has attracted a great attention in recent years. In this paper, we will show that most of $n$-dimensional hypercube-like graphs have two mutually independent hamiltonian cycles. Moreover, we also develop a systematic linear time algorithm for(More)
  • 1