We study two topological properties of the 5-ary -cube . Given two arbitrary distinct nodes and in , we prove that there exists an - path of every length ranging from to , where . Based on this result, we prove that is 5-edge-pancyclic by showing that every edge in lies on a cycle of every length ranging from to .
@article{ITA_2009__43_1_133_0, author = {Lin, Tsong-Jie and Hsieh, Sun-Yuan and Huang, Hui-Ling}, title = {Cycle and path embedding on 5-ary N-cubes}, journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications}, volume = {43}, year = {2009}, pages = {133-144}, doi = {10.1051/ita:2008004}, mrnumber = {2483447}, zbl = {1156.68041}, language = {en}, url = {http://dml.mathdoc.fr/item/ITA_2009__43_1_133_0} }
Lin, Tsong-Jie; Hsieh, Sun-Yuan; Huang, Hui-Ling. Cycle and path embedding on 5-ary N-cubes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) pp. 133-144. doi : 10.1051/ita:2008004. http://gdmltest.u-ga.fr/item/ITA_2009__43_1_133_0/
[1] Parallel Computation: Models and Methods Prentice Hall, NJ (1997).
,[2] iWarp: an integrated solution to high-speed parallel computing, Proceedings of the 1988 ACM/IEEE conference on Supercomputing (1988) 330-339.
, , , , , , , , , , , , , and ,[3] Lee distance and topological properties of k-ary n-cubes. IEEE Trans. Comput. 44 (1995) 1021-1030. | MR 1349941 | Zbl 1054.68510
, , and ,[4] Panconnectivity, fault-Tolorant Hamiltonicity and Hamiltonian-connectivity in alternating group graphs. Networks 44 (2004) 302-310. | MR 2098393 | Zbl 1055.05076
, and ,[5] Fault diameter of k-ary n-cube Networks. IEEE Transactions on Parallel and Distributed Systems, 8 (1997) 903-907.
and ,[6] The -ary -cube network: modeling, topological properties and routing strategies. Comput. Electr. Eng. (2003) 1271-1284.
and ,[7] Panconnectivity and edge-pancyclicity of 3-ary N-cubes. J. Supercomputing 42 (2007) 225-233.
, and ,[8] Introduction to Parallel Algorithms and Architecture: Arrays Trees Hypercubes. Morgan Kaufmann, San Mateo, CA (1992). | MR 1137272 | Zbl 0743.68007
,[9] Panconnectivity of locally twisted cubes. Appl. Math. Lett. 19 (2006) 673-677. | MR 2224423 | Zbl 1118.05050
and ,[10] Embedding one interconnection network in another. Computing Suppl. 7 (1990) 257-282. | MR 1059934 | Zbl 0699.68017
and ,[11] Massively parallel processor system CRAY T3D. Technical Report, Cray Research GmbH (1993).
,[12] Cycles in Networks. Technical Report: UM-CS-1991-020, University of Massachusetts, Amherst, MA, USA (1991).
,[13] Submicron systems architecture project semi-annual technical report. Technical Report Caltec-CS-TR-88-18, California Institute of Technology (1988).
et al.,[14] Panconnectivity of locally connected claw-free graphs. Discrete Mathematics 203 (1999) 253-260. | MR 1696247 | Zbl 0934.05078
, and ,[15] A new sufficient condition for panconnected graphs. Ars Combinatoria 34 (1992) 161-166. | MR 1206559 | Zbl 0770.05069
and ,[16] Hamiltonian-like properies of -Ary -Cubes, in Proceedings PDCAT05 of Sixth International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT05), IEEE Computer Society Press (2005) pp. 1002-1007.
, , , and ,