Embedding of cycles in twisted cubes with edge-pancyclic

DOI10.1007/S00453-007-9024-7MaRDI QIDQ930597zbMATHOpenAlexDBLPWikidataFDO

Authors Jianxi Fan, Xiao-La Lin, X.-H. Jia

Publication date 1 July 2008

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-007-9024-7

zbMATH Keywords

CycleEmbeddingInterconnection networkDilationEdge-pancyclicityTwisted cube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99)

Recommendations

• Algorithms and Computation
• On embedding cycles into faulty twisted cubes
• Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
• Geodesic pancyclicity of twisted cubes
• Locally twisted cubes are 4-pancyclic.

Cites work

• A note on vertex pancyclic oriented graphs
• Edge-pancyclic block-intersection graphs
• Edge-pancyclicity of coupled graphs
• Edge-pancyclicity of recursive circulants
• Embedding binary trees into crossed cubes
• Embedding graphs onto the Supercube
• Fault-tolerant Hamiltonicity of twisted cubes
• Fault-tolerant cycle embedding in the hypercube
• Fault-tolerant cycle-embedding of crossed cubes
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• On embedding cycles into faulty twisted cubes
• Topological properties of twisted cube
• Vertex pancyclic graphs

Cited in

(32)

• Independent spanning trees in crossed cubes
• Cycles embedding in exchanged crossed cube
• Hamiltonian properties of honeycomb meshes
• On the \(t/k\)-diagnosability of BC networks
• Embedding a family of meshes into twisted cubes
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Geodesic pancyclicity of twisted cubes
• Independent spanning trees on twisted cubes
• Matroidal connectivity and conditional matroidal connectivity of star graphs
• Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
• Reliability analysis of twisted cubes
• Edge-fault-tolerant node-pancyclicity of twisted cubes
• scientific article; zbMATH DE number 165468 (Why is no real title available?)
• (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
• Embeddings of circulant networks
• A fast fault-identification algorithm for bijective connection graphs using the PMC model
• One-to-one communication in twisted cubes under restricted connectivity
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
• scientific article; zbMATH DE number 5008096 (Why is no real title available?)
• Algorithms and Computation
• Vertex-pancyclicity of twisted cubes with maximal faulty edges
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• A parallel algorithm for constructing independent spanning trees in twisted cubes
• Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
• Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Embedding of tori and grids into twisted cubes
• Locally twisted cubes are 4-pancyclic.
• Embedding Wheel - like Networks
• Paths and cycles identifying vertices in twisted cubes
• The congestion of generalized cube communication pattern in linear array network

This page was built for publication: Embedding of cycles in twisted cubes with edge-pancyclic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930597)