Embedding mutually edge-disjoint cycles into locally twisted cubes

DOI10.1016/j.tcs.2022.06.027OpenAlexW4283077293MaRDI QIDQ2166726

Dongqin Cheng

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.027

zbMATH Keywords

interconnection networkcycle embeddinglocally twisted cubemutually edge-disjoint

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The generalized 4-connectivity of locally twisted cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-disjoint odd cycles in 4-edge-connected graphs
• \(h\)-restricted connectivity of locally twisted cubes
• Fault-tolerant edge-pancyclicity of locally twisted cubes
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• \(\{2,3\}\)-restricted connectivity of locally twisted cubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Locally twisted cubes are 4-pancyclic.
• A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
• Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
• Construction independent spanning trees on locally twisted cubes in parallel
• Panconnectivity of locally twisted cubes
• The \(g\)-good-neighbor diagnosability of locally twisted cubes
• A fast diagnosis algorithm for locally twisted cube multiprocessor systems under the MM\(^{*}\) model
• The locally twisted cubes

This page was built for publication: Embedding mutually edge-disjoint cycles into locally twisted cubes