Panconnectivity and Edge-Pancyclicity of k-Ary n-Cubes
In this article, we study some topological properties of k-ary n-cubes Q(n)(k). We show that each edge in Q(n)(k) lies on a cycle of every length from k to k(n). We also show that Q(n)(k) is both bipanconnected and edge-bipancyclic, where n >= 2 is an integer and k >= 2 is an even integer. (C) 2009 Wiley Periodicals, Inc. NETWORKS, Vol. 54(1), 1-11 2009
panconnectivity edge-pancyclicity k-ary n-cubes bipanconnectivity bipancyclicity graph-theoretic interconnection networks graph theory hypercubes