Abstract
The k-ary n-cube has been one of the most popular interconnection networks for parallel computing. In this paper, we assume that k⩾4 is an even. Under this assumption we investigate the Hamiltonian cycle of k-ary 2-cube with the set F of faulty elements (vertices and/or edges), and will prove that k-ary 2-cube is 2-fault bi-Hamiltonian.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Optik - International Journal for Light and Electron Optics
Paper Title
Journal
Date
