The spanning cyclability of Cayley graphs generated by transposition trees
From MaRDI portal
Recommendations
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
- Thek-degree Cayley graph and its topological properties
- Hamiltonian connectivity of 2-tree-generated networks
- Bipancyclic properties of Cayley graphs generated by transpositions
Cites work
- 2-spanning cyclability problems of some generalized Petersen graphs
- Automorphism groups of Cayley graphs generated by connected transposition sets
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- Bipancyclic properties of Cayley graphs generated by transpositions
- Conditional connectivity of Cayley graphs generated by transposition trees
- Cycle embedding in star graphs with conditional edge faults
- Cycle embedding in star graphs with edge faults
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Graph theory
- Hamiltonian laceability of bubble-sort graphs with edge faults
- Hamiltonian-laceability of star graphs
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 3801574 (Why is no real title available?)
- scientific article; zbMATH DE number 7491960 (Why is no real title available?)
- Linearly many faults in Cayley graphs generated by transposition trees
- One conjecture of bubble-sort graphs
- Path embedding in star graphs
- Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph
- Survey on path and cycle embedding in some networks
- Torus-like graphs and their paired many-to-many disjoint path covers
Cited in
(14)- Restricted connectivity of Cayley graph generated by transposition trees
- Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle
- Disjoint Hamilton cycles in transposition graphs
- On the sharpness of a bound on the diameter of Cayley graphs generated by transposition trees
- scientific article; zbMATH DE number 5139492 (Why is no real title available?)
- Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
- The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- On the 2-spanning cyclability of honeycomb toroidal graphs
- Edge-fault-tolerant edge-bipancyclicity of modified bubble-sort graphs
- Paired (n - 1)-to-(n - 1) disjoint path covers in bipartite transposition-like graphs
- The cyclic diagnosability of Cayley graphs generated by transposition trees
- Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
- Orienting Cayley graphs generated by transposition trees
This page was built for publication: The spanning cyclability 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 Q2685695)