Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
From MaRDI portal
(Redirected from Publication:456645)
Recommendations
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Hamilton paths in Cayley graphs on Coxeter groups. I.
- Fault-tolerant-prescribed Hamiltonian laceability of balanced hypercubes
Cites work
- scientific article; zbMATH DE number 3801574 (Why is no real title available?)
- Conditional connectivity of Cayley graphs generated by transposition trees
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Embedding of cycles in arrangement graphs
- 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 Hamiltonian laceability of hypercubes.
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Hamilton cycles and paths in butterfly graphs
- Hamiltonian cycles in the shuffle-exchange network
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
- Hamiltonian-laceability of star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
- Linear array and ring embeddings in conditional faulty hypercubes
- Linearly many faults in Cayley graphs generated by transposition trees
Cited in
(14)- Hamiltonian laceability of bubble-sort graphs with edge faults
- Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- Local diagnosability of bipartite graphs with conditional faulty edges under Preparata, Metze and Chien's model
- Linearly many faults in Cayley graphs generated by transposition trees
- Fault-free Hamiltonian cycles in balanced hypercubes with conditional edge faults
- The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model
- The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs
- The spanning cyclability of Cayley graphs generated by transposition trees
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
- Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
- The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM\(^\ast\) model
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Hyper hamiltonian laceability of Cayley graphs generated by transpositions
This page was built for publication: Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456645)