Changing the diameter of the locally twisted cube

DOI10.1080/00207160.2012.742190zbMath1295.68039MaRDI 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

diameter; interconnection networks; locally twisted cube; parallel computing system; maximum communication time

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

65Y05: Parallel numerical computation

68M07: Mathematical problems of computer architecture

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

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

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