Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
Information Processing Letters
Hamiltonian-like Properties of k-Ary n-Cubes
PDCAT '05 Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies
Path bipancyclicity of hypercubes
Information Processing Letters
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
Parallel Computing
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Edge-fault-tolerant bipanconnectivity of hypercubes
Information Sciences: an International Journal
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
IEEE Transactions on Parallel and Distributed Systems
Long paths in hypercubes with conditional node-faults
Information Sciences: an International Journal
Edge-pancyclicity of Möbius cubes
Information Processing Letters
Node-pancyclicity and edge-pancyclicity of crossed cubes
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.00 |
A graph G of order n (驴2) is said to be panconnected if for each pair (x,y) of vertices of G there exists an xy-path of length 驴 for each 驴 such that d G (x,y)驴驴驴n驴1, where d G (x,y) denotes the length of a shortest xy-path in G. In this paper, we consider the panconnectivity of Cartesian product graphs. As a consequence of our results, we prove that the n-dimensional generalized hypercube Q n (k 1,k 2,驴,k n ) is panconnected if and only if k i 驴3 (i=1,驴,n), which generalizes a result of Hsieh et al. that the 3-ary n-cube $Q^{3}_{n}$ is panconnected.