Node-pancyclicity and edge-pancyclicity of crossed cubes
From MaRDI portal
Publication:835009
DOI10.1016/j.ipl.2004.09.026zbMath1169.05339OpenAlexW1983569347WikidataQ60402893 ScholiaQ60402893MaRDI QIDQ835009
Jianxi Fan, Xiaola Lin, Xiao-Hua Jia
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.09.026
Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Paths and cycles (05C38)
Related Items (34)
Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs ⋮ Node-pancyclicity and edge-pancyclicity of hypercube variants ⋮ Cycles passing through prescribed edges in a hypercube with some faulty edges ⋮ Edge-pancyclicity and Hamiltonian laceability of the balanced hypercubes ⋮ Node-disjoint paths in hierarchical hypercube networks ⋮ Constructing the nearly shortest path in crossed cubes ⋮ \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn ⋮ On pancyclicity properties of OTIS-mesh ⋮ Cycles Embedding in Exchanged Crossed Cube ⋮ Embedding of cycles in twisted cubes with edge-pancyclic ⋮ The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ Fault-tolerant cycle-embedding in alternating group graphs ⋮ Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions ⋮ A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube ⋮ Panconnectivity and edge-pancyclicity ofk-aryn-cubes ⋮ Cycle embedding of augmented cubes ⋮ Edge-fault-tolerant node-pancyclicity of twisted cubes ⋮ Vertex-pancyclicity of augmented cubes with maximal faulty edges ⋮ Complete path embeddings in crossed cubes ⋮ The conditional diagnosability of crossed cubes under the comparison model ⋮ Survey on path and cycle embedding in some networks ⋮ Edge-pancyclicity of Möbius cubes ⋮ Paths in Möbius cubes and crossed cubes ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Cites Work
- Connectivity of the crossed cube
- Fault-tolerant cycle-embedding of crossed cubes
- Edge-pancyclicity of recursive circulants
- Edge-pancyclic block-intersection graphs
- Topological properties of the crossed cube architecture
- Edge-pancyclicity of coupled graphs
- Vertex pancyclic graphs
- A note on vertex pancyclic oriented graphs
- Embedding binary trees into crossed cubes
This page was built for publication: Node-pancyclicity and edge-pancyclicity of crossed cubes