On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes

zbMATH Open1084.68010MaRDI QIDQ3372053FDOQ3372053

Authors: Xiaofan Yang, Graham M. Megson, D. J. Evans, Yuan Yan Tang 

Publication date: 17 February 2006

Recommendations

• On the double-vertex-cycle-connectivity of crossed cubes
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• scientific article
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture

zbMATH Keywords

interconnection network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cited In (15)

• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Geodesic pancyclicity and balanced pancyclicity of augmented cubes
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
• On the double-vertex-cycle-connectivity of crossed cubes
• Survey on path and cycle embedding in some networks
• Geodesic pancyclicity of twisted cubes
• Title not available (Why is that?)
• Edge-pancyclicity of Möbius cubes
• Paths in Möbius cubes and crossed cubes
• Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
• Complete path embeddings in crossed cubes
• On crossing numbers of hypercubes and cube connected cycles
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Title not available (Why is that?)
• Constructing the nearly shortest path in crossed cubes

This page was built for publication: On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372053)