Embedding of cycles in twisted cubes with edge-pancyclic
From MaRDI portal
Publication:930597
DOI10.1007/S00453-007-9024-7zbMATH Open1203.68023DBLPjournals/algorithmica/FanJL08OpenAlexW1974755543WikidataQ60402671 ScholiaQ60402671MaRDI QIDQ930597FDOQ930597
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
Recommendations
Cites Work
- Fault-tolerant cycle embedding in the hypercube
- Fault-tolerant cycle-embedding of crossed cubes
- Edge-pancyclic block-intersection graphs
- On embedding cycles into faulty twisted cubes
- Edge-pancyclicity of recursive circulants
- Embedding graphs onto the Supercube
- Embedding binary trees into crossed cubes
- Topological properties of twisted cube
- Fault-tolerant Hamiltonicity of twisted cubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- A note on vertex pancyclic oriented graphs
- Vertex pancyclic graphs
- Edge-pancyclicity of coupled graphs
Cited In (32)
- Paths and cycles identifying vertices in twisted cubes
- Matroidal connectivity and conditional matroidal connectivity of star graphs
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
- One-to-one communication in twisted cubes under restricted connectivity
- Independent spanning trees on twisted cubes
- (n − 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn
- Independent spanning trees in crossed cubes
- On the \(t/k\)-diagnosability of BC networks
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Geodesic pancyclicity of twisted cubes
- Title not available (Why is that?)
- Constructing edge-disjoint spanning trees in twisted cubes
- Cycles embedding in exchanged crossed cube
- \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Locally twisted cubes are 4-pancyclic.
- Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
- Embedding Wheel - like Networks
- The congestion of generalized cube communication pattern in linear array network
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Algorithms and Computation
- Hamiltonian properties of honeycomb meshes
- Reliability analysis of twisted cubes
- Embeddings of circulant networks
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- Embedding of tori and grids into 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
- Embedding a family of meshes into twisted cubes
- Title not available (Why is that?)
- Vertex-pancyclicity of twisted cubes with maximal faulty edges
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)
