Cycle embedding of augmented cubes
From MaRDI portal
Publication:990439
DOI10.1016/J.AMC.2007.02.089zbMATH Open1193.05098OpenAlexW2018848210MaRDI QIDQ990439FDOQ990439
Authors: Sun-Yuan Hsieh, Jung-Yiau Shiu 
Publication date: 1 September 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.02.089
Recommendations
Cites Work
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Pancyclic graphs. I
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- Parallel concepts in graph theory
- Pancyclicity of hamiltonian line graphs
- Augmented cubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Pancyclicity of recursive circulant graphs
- A note on vertex pancyclic oriented graphs
- Vertex pancyclic graphs
- A new variation on hypercubes with smaller diameter
- On pancyclism in Hamiltonian graphs
Cited In (25)
- Edge-fault-tolerant vertex-pancyclicity of augmented cubes
- Vertex-pancyclicity of augmented cubes with maximal faulty edges
- Conditional edge-fault Hamiltonicity of augmented cubes
- Conditional edge-fault pancyclicity of augmented cubes
- Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
- Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Two node-disjoint paths in balanced hypercubes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- Minimum linear arrangement of chord graphs
- Survey on path and cycle embedding in some networks
- Strong matching preclusion for augmented cubes
- Super connectivity of \(k\)-regular interconnection networks
- On regular subgraphs of augmented cubes
- An optimal time algorithm for minimum linear arrangement of chord graphs
- The vertex-pancyclicity of data center networks
- Cycle and Path Embedding on 5-ary N-cubes
- Vertex-bipancyclicity of the generalized honeycomb tori
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- The panpositionable panconnectedness of augmented cubes
- An upper bound for the crossing number of augmented cubes
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
This page was built for publication: Cycle embedding of augmented cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990439)
