Hamiltonian-like Properties of k-Ary n-Cubes

Authors:
Deqiang Wang;Mingyang Pan;Tong An;Kelun Wang;Shuyan Qu
Affiliations:
Dalian Maritime University, Dalian, CHINA;Dalian Maritime University, Dalian, CHINA;Mathematics Department, Tianjin University of Finance and Economics, CHINA;Mathematics Department, Dalian Maritime University, Dalian , CHINA;Mathematics Department, Dalian Maritime University, Dalian , CHINA
Venue:
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Year:
2005

Citing 0
Cited 9

Panconnectivity and edge-pancyclicity of 3-ary N-cubes

The Journal of Supercomputing
Strongly Hamiltonian laceability of the even k-ary n-cube

Computers and Electrical Engineering
Hamiltonian property on binary recursive networks

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges

Information Sciences: an International Journal
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even

Computers and Electrical Engineering
Panconnectivity of Cartesian product graphs

The Journal of Supercomputing
One-to-one disjoint path covers on k-ary n-cubes

Theoretical Computer Science
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Hamiltonicity and Pancyclicity of binary recursive networks

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some Hamiltonian-like properties of k-ary n-cube are explored. In this paper, we show that k-ary 2-cube is almost Hamiltonian-connected, bipanconnected, bipancyclic. And we prove that k-ary n-cube is almost Hamiltonian-connected when n \ge3 , and Hamiltonianconnected if k is odd.