Embedding meshes into locally twisted cubes
From MaRDI portal
Publication:991908
DOI10.1016/J.INS.2010.06.001zbMATH Open1205.68036OpenAlexW2078354568MaRDI QIDQ991908FDOQ991908
Ji-Wen Yang, Shukui Zhang, Jianxi Fan, Yuejuan Han, Peide Qian
Publication date: 8 September 2010
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2010.06.001
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Locally twisted cubes are 4-pancyclic.
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Fault-tolerant cycle-embedding in alternating group graphs
- The locally twisted cubes
- Embedding graphs onto the Supercube
- Embedding meshes into crossed cubes
- Embedding of meshes in Möbius cubes
- Embedding a family of meshes into twisted cubes
Cited In (33)
- The generalized 4-connectivity of locally twisted cubes
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Doing the twist: diagonal meshes are isomorphic to twisted toroidal meshes
- Locally exchanged twisted cubes: connectivity and super connectivity
- Efficient unicast in bijective connection networks with the restricted faulty node set
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Construction independent spanning trees on locally twisted cubes in parallel
- Changing the diameter of the locally twisted cube
- Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
- A linear time algorithm for embedding hypercube into cylinder and torus
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding a family of disjoint multi-dimensional meshes into a crossed cube
- Locally twisted cubes are 4-pancyclic.
- Improving the panconnectedness property of locally twisted cubes
- Embedding Wheel - like Networks
- Linear layout of locally twisted cubes
- Reliability evaluation for bijection-connected networks based on the super \(P_k\)-connectivity
- Optimal broadcasting for locally twisted cubes
- Optimal Embedding of Locally Twisted Cubes into Grids
- Embedding of hypercubes into sibling trees
- Bothway embedding of circulant network into grid
- Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
- Embeddings of circulant networks
- Embedding meshes into twisted-cubes
- Communication Performance Evaluation of the Locally Twisted Cube
- Wirelength of embedding complete multipartite graphs into certain graphs
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- 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 locally twisted cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991908)
