Subscribe
Issue No.01  January (2009 vol.20)
pp: 2533
Iain A. Stewart , University of Durham, Durham
Yonghong Xiang , University of Durham, Durham
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.45
ABSTRACT
In this paper we give precise solutions to problems posed by Wang, An, Pan, Wang and Qu and by Hsieh, Lin and Huang. In particular, we show that Qnk is bipanconnected and edgebipancyclic, when k ≥ 3 and n ≥ 2, and we also show that when k is odd, Qnk is mpanconnected, for m=(n(k1)+2k6)/2, and (k1)pancyclic (these bounds are optimal). We introduce a pathshortening technique, called progressive shortening, and strengthen existing results, showing that when paths are formed using progressive shortening then these paths can be efficiently constructed and used to solve a problem relating to the distributed simulation of linear arrays and cycles in a parallel machine whose interconnection network is Qnk, even in the presence of a faulty processor.
INDEX TERMS
Interconnection architectures, Path and circuit problems
CITATION
Iain A. Stewart, Yonghong Xiang, "Bipanconnectivity and Bipancyclicity in kary ncubes", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 1, pp. 2533, January 2009, doi:10.1109/TPDS.2008.45
REFERENCES
