Embedding meshes into twisted-cubes
DOI10.1016/J.INS.2011.02.019zbMATH Open1218.68111DBLPjournals/isci/WangFJZY11OpenAlexW2084965623WikidataQ60402439 ScholiaQ60402439MaRDI QIDQ545387FDOQ545387
Jia Yu, Jianxi Fan, X.-H. Jia, Shukui Zhang, Xi Wang
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Network design and communication in computer systems (68M10)
Cites Work
- Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
- A note on cycle embedding in folded hypercubes with faulty elements
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Fault-tolerant cycle-embedding in alternating group graphs
- Embedding meshes into locally twisted cubes
- Embedding of cycles in arrangement graphs
- Path embeddings in faulty 3-ary \(n\)-cubes
- Optimal fault-tolerant embedding of paths in twisted cubes
- Embedding graphs onto the Supercube
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- The twisted-cube connected networks
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- On embedding subclasses of height-balanced trees in hypercubes
- Embedding meshes into crossed cubes
- Embedding of meshes in Möbius cubes
- Fault-tolerant embedding of paths in crossed cubes
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Embedding a family of disjoint 3D meshes into a crossed cube
- Constructing edge-disjoint spanning trees in twisted cubes
- Embedding a family of meshes into twisted cubes
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Enhancing fault tolerance of balanced hypercube networks by the edge partition method
- Doing the twist: diagonal meshes are isomorphic to twisted toroidal meshes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
- The number of short cycles in Fibonacci cubes
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Multiple regular graph embeddings into a hypercube with unbounded expansion
- Vertex-independent spanning trees in complete Josephus cubes
- A fast parallel algorithm for constructing independent spanning trees on parity cubes
- Embedding a family of meshes into twisted cubes
- An algorithm to construct independent spanning trees on parity cubes
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
This page was built for publication: Embedding meshes into twisted-cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545387)
