Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
From MaRDI portal
(Redirected from Publication:1007887)
Recommendations
- An optimal result on fault-tolerant cycle-embedding in alternating group graphs
- Fault-tolerant cycle-embedding in alternating group graphs
- Conditional fault Hamiltonicity of the complete graph
- Edge‐fault‐tolerant pancyclicity of alternating group graphs
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
Cites work
- scientific article; zbMATH DE number 828049 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- A new class of interconnection networks based on the alternating group
- Augmented cubes
- Combinatorial analysis of the fault-diameter of the n-cube
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Efficient Gossiping by Packets in Networks with Random Faults
- Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Fault-free longest paths in star networks with conditional link faults
- Fault-tolerant cycle-embedding in alternating group graphs
- Hamiltonian fault-tolerance of hypercubes
- Hyper Hamiltonian laceability on edge fault star graph
- Linear array and ring embeddings in conditional faulty hypercubes
- Longest fault-free paths in star graphs with vertex faults
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- On the arrangement graph.
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Panpositionable hamiltonicity of the alternating group graphs
- Robustness of star graph network under link failure
- The shuffle-cubes and their generalization
Cited in
(15)- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Conditional edge-fault Hamiltonicity of augmented cubes
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Fault-tolerant cycles embedding in hypercubes with faulty edges
- Two disjoint cycles of various lengths in alternating group graph
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Embedding meshes into twisted-cubes
- A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
- A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
- Hamiltonian cycle embeddings in faulty hypercubes under the forbidden faulty set model
- On the reliability of alternating group graph-based networks
- Two-node-Hamiltonicity of enhanced pyramid networks
This page was built for publication: Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007887)
