Embedding binary trees into crossed cubes
From MaRDI portal
Publication:4421228
DOI10.1109/12.392850zbMath1053.68585OpenAlexW2157953482MaRDI QIDQ4421228
Saïd Bettayeb, Priyalal D. Kulasinghe
Publication date: 1995
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.392850
Related Items (35)
Connectivity of the crossed cube ⋮ Node-pancyclicity and edge-pancyclicity of crossed cubes ⋮ Embedding meshes into crossed cubes ⋮ \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) ⋮ Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Constructing the nearly shortest path in crossed cubes ⋮ On the double-vertex-cycle-connectivity of crossed cubes ⋮ A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Conditional fault diameter of crossed cubes ⋮ Embedding a mesh of trees in the crossed cube ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ The \(g\)-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model ⋮ Embedding of cycles in twisted cubes with edge-pancyclic ⋮ The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks ⋮ Embedding of meshes in Möbius cubes ⋮ Fault-free Hamiltonian cycles in crossed cubes with conditional link faults ⋮ Multiply-twisted hypercube with five or more dimensions is not vertex-transitive ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Constructing optimal subnetworks for the crossed cube network ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ On embedding cycles into faulty twisted cubes ⋮ 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 ⋮ Complete path embeddings in crossed cubes ⋮ Path embedding in star graphs ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ Fault-tolerant cycle-embedding of crossed cubes ⋮ Embedding a family of disjoint 3D meshes into a crossed cube ⋮ The twisted-cube connected networks ⋮ Paths in Möbius cubes and crossed cubes ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ Independent spanning trees in crossed cubes
This page was built for publication: Embedding binary trees into crossed cubes
