Hamiltonian laceability of bubble-sort graphs with edge faults
From MaRDI portal
Recommendations
- Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Fault-tolerant Hamiltonian laceability of hypercubes.
- One conjecture of bubble-sort graphs
Cites work
- scientific article; zbMATH DE number 3801574 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Complete path embeddings in crossed cubes
- Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Hamilton cycles and paths in butterfly graphs
- Hamiltonian-laceability of star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Longest fault-free paths in hypercubes with vertex faults
- On the \(k\)-path cover problem for cacti
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
Cited in
(29)- Subnetwork preclusion for bubble-sort networks
- One conjecture of bubble-sort graphs
- A note on Hamiltonian decomposition of bubble-sort graphs
- Conditional edge-fault Hamiltonicity of augmented cubes
- Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Edge-fault-tolerant edge-bipancyclicity of bubble-sort graphs
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Survey on path and cycle embedding in some networks
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- The \(Q_{n,k,m}\) graph: a common generalization of various popular interconnection networks
- Subnetwork reliability analysis of bubble-sort graph networks
- Structure connectivity and substructure connectivity of wheel networks
- The spanning cyclability of Cayley graphs generated by transposition trees
- Generalized measures of fault tolerance for bubble sort networks
- Path and cycle fault tolerance of bubble-sort graph networks
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks
- Conditional diagnosability of matching composition networks under the \(\mathrm{MM}^\ast\) model
- Neighbor connectivity of bubble-sort star graphs
- Conditional connectivity of recursive interconnection networks respect to embedding restriction
- Cyclic vertex-connectivity of Cayley graphs generated by transposition trees
- Hamiltonian laceability of bubble-sort star graphs with edge-faults
- Double declined subnetwork reliability analysis in bubble-sort networks under node fault model
- Structure connectivity and substructure connectivity of bubble-sort star graph networks
- Constructing vertex-disjoint paths in \((n, k)\)-star graphs
- Extra (component) connectivity and diagnosability of bubble sort networks
- Fault tolerance in bubble-sort graph networks
- Estimating the subsystem reliability of bubblesort networks
- Fault-tolerant Hamiltonian laceability of balanced hypercubes
This page was built for publication: Hamiltonian laceability of bubble-sort graphs with edge faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q881895)
