Embedding meshes into twisted-cubes
From MaRDI portal
Publication:545387
DOI10.1016/j.ins.2011.02.019zbMath1218.68111OpenAlexW2084965623WikidataQ60402439 ScholiaQ60402439MaRDI QIDQ545387
Jia Yu, Jianxi Fan, Shukui Zhang, Xi Wang, Xiao-Hua Jia
Publication date: 22 June 2011
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.02.019
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (10)
How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\) ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Enhancing fault tolerance of balanced hypercube networks by the edge partition method ⋮ Multiple regular graph embeddings into a hypercube with unbounded expansion ⋮ Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ The number of short cycles in Fibonacci cubes ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn
Cites Work
- Unnamed Item
- Unnamed Item
- Path embeddings in faulty 3-ary \(n\)-cubes
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Optimal fault-tolerant embedding of paths in twisted cubes
- Embedding of meshes in Möbius cubes
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- Fault-tolerant embedding of paths in crossed cubes
- A note on cycle embedding in folded hypercubes with faulty elements
- Embedding a family of meshes into twisted cubes
- Embedding meshes into locally twisted cubes
- On embedding subclasses of height-balanced trees in hypercubes
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Embedding a family of disjoint 3D meshes into a crossed cube
- The twisted-cube connected networks
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Embedding meshes into crossed cubes
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Fault-tolerant cycle-embedding in alternating group graphs
- Constructing edge-disjoint spanning trees in twisted cubes
- Embedding graphs onto the Supercube
- Embedding of cycles in arrangement graphs
This page was built for publication: Embedding meshes into twisted-cubes
