The k-ary n-cube is one of the popular topologies for interconnecting processors in multicomputers. This paper studies the difference in communication requirements between two Lee distance Gray codes when moving data from processors in normal radix k order to those in Gray code order in k-ary n-cube
Panconnectivity and edge-pancyclicity of k-ary n-cubes
β Scribed by Sun-Yuan Hsieh; Tsong-Jie Lin
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 266 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Zero-kinetic-energy photoelectron spectroscopy was used to measure the Franck-Condon factors for the carbon and nitrogen K-shell ionized states in Nz and CO. Corresponding features in the two spectra showed nearly identical energy spacings, both below and above the ionization threshold, as predicted
In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n β₯ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.
## Abstract It is well known that seafood contains high levels of arsenic. For marine animals arsenic is predominantly present as arsenobetaine and related compounds which are not metabolized and are thought to present no toxic hazard to humans. With edible seaweeds, arsenic is present in different