Changing the diameter of the locally twisted cube

DOI10.1080/00207160.2012.742190zbMath1295.68039OpenAlexW2046421475MaRDI QIDQ2852108

Jianxi Fan, Shukui Zhang, Yuejuan Han

Publication date: 8 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.742190

zbMATH Keywords

diameterinterconnection networkslocally twisted cubeparallel computing systemmaximum communication time

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05) Mathematical problems of computer architecture (68M07) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Characterizations of optimal component cuts of locally twisted cubes ⋮ Linear layout of locally twisted cubes ⋮ Communication Performance Evaluation of the Locally Twisted Cube

Cites Work

• Efficient unicast in bijective connection networks with the restricted faulty node set
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Independent spanning trees on twisted cubes
• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Diameter variability of cycles and tori
• Embedding meshes into locally twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Changing and unchanging the diameter of a hypercube
• Locally twisted cubes are 4-pancyclic.
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Panconnectivity of locally twisted cubes
• Fault-tolerant embedding of meshes/tori in twisted cubes
• The locally twisted cubes

This page was built for publication: Changing the diameter of the locally twisted cube