Node-pancyclicity and edge-pancyclicity of crossed cubes

Authors:
Jianxi Fan;Xiaola Lin;Xiaohua Jia
Affiliations:
Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong;Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong;Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Hong Kong
Venue:
Information Processing Letters
Year:
2005

Citing 15
Cited 16

Topological Properties of Hypercubes

IEEE Transactions on Computers
A Variation on the Hypercube with Lower Diameter

IEEE Transactions on Computers
Edge-pancyclic block-intersection graphs

Discrete Mathematics - Special volume: Designs and Graphs
Topological properties of the crossed cube architecture

Parallel Computing
Connectivity of the crossed cube

Information Processing Letters
Edge Congestion and Topological Properties of Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Embedding Binary Trees into Crossed Cubes

IEEE Transactions on Computers
The Crossed Cube Architecture for Parallel Computation

IEEE Transactions on Parallel and Distributed Systems
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model

IEEE Transactions on Parallel and Distributed Systems
Vertex pancyclic graphs

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Edge-pancyclicity of coupled graphs

Discrete Applied Mathematics
Fault-tolerant cycle-emebedding of crossed cubes

Information Processing Letters
Edge-pancyclicity of recursive circulants

Information Processing Letters
The t/k-Diagnosability of the BC Graphs

IEEE Transactions on Computers
A note on vertex pancyclic oriented graphs

Journal of Graph Theory

Optimal Path Embedding in Crossed Cubes

IEEE Transactions on Parallel and Distributed Systems
Edge-pancyclicity of Möbius cubes

Information Processing Letters
Paths in Möbius cubes and crossed cubes

Information Processing Letters
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs

Information Processing Letters
Node-pancyclicity and edge-pancyclicity of hypercube variants

Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements

Theoretical Computer Science
Node-disjoint paths in hierarchical hypercube networks

Information Sciences: an International Journal
Cycles passing through prescribed edges in a hypercube with some faulty edges

Information Processing Letters
The bipanconnectivity and m-panconnectivity of the folded hypercube

Theoretical Computer Science
Edge-pancyclicity and path-embeddability of bijective connection graphs

Information Sciences: an International Journal
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)

Theoretical Computer Science
Fault-tolerant embedding of paths in crossed cubes

Theoretical Computer Science
Constructing the nearly shortest path in crossed cubes

Information Sciences: an International Journal
Embedding fault-free cycles in crossed cubes with conditional link faults

The Journal of Supercomputing
Edge-fault-tolerant node-pancyclicity of twisted cubes

Information Processing Letters
Path embeddings in faulty 3-ary n-cubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.90

Visualization

Abstract

Crossed cubes are important variants of the hypercubes. It has been proven that crossed cubes have attractive properties in Hamiltonian connectivity and pancyclicity. In this paper, we study two stronger features of crossed cubes. We prove that the n-dimensional crossed cube is not only node-pancyclic but also edge-pancyclic for n ≥ 2. We also show that the similar property holds for hypercubes.