Complete path embeddings in crossed cubes
From MaRDI portal
Publication:2509240
DOI10.1016/j.ins.2006.01.001zbMath1101.68004OpenAlexW2079184636WikidataQ60402775 ScholiaQ60402775MaRDI QIDQ2509240
Xiaola Lin, Jianxi Fan, Xiao-Hua Jia
Publication date: 19 October 2006
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2006.01.001
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (36)
Embedding meshes into crossed cubes ⋮ Path embeddings in faulty 3-ary \(n\)-cubes ⋮ Constructing the nearly shortest path in crossed cubes ⋮ A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network ⋮ Hamiltonian laceability of bubble-sort graphs with edge faults ⋮ Two spanning disjoint paths with required length in generalized hypercubes ⋮ Geodesic pancyclicity and balanced pancyclicity of the generalized base-\(b\) hypercube ⋮ (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn ⋮ Geodesic pancyclicity of twisted cubes ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Embedding a long fault-free cycle in a crossed cube with more faulty nodes ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ The \(m\)-pancycle-connectivity of a WK-recursive network ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ A note on path embedding in crossed cubes with faulty vertices ⋮ Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position ⋮ Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions ⋮ Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ The bipancycle-connectivity of the hypercube ⋮ Panconnectivity and edge-pancyclicity of multidimensional torus networks ⋮ Independent spanning trees in crossed cubes ⋮ Embedding meshes/tori in faulty crossed cubes ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ Survey on path and cycle embedding in some networks ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
Cites Work
This page was built for publication: Complete path embeddings in crossed cubes
