Conditional fault-tolerant Hamiltonicity of star graphs
From MaRDI portal
Recommendations
- Conditional fault Hamiltonicity of the star graph.
- Cycle embedding in star graphs with more conditional faulty edges
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
- Hyper Hamiltonian laceability on edge fault star graph
Cited in
(13)- Fault-free longest paths in star networks with conditional link faults
- The \(t/k\)-diagnosability and strong Menger connectivity on star graphs with conditional faults
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- On the construction of combined k-fault-tolerant Hamiltonian graphs
- Conditional fault Hamiltonicity of the star graph.
- Fault-free mutually independent Hamiltonian cycles of faulty star graphs
- Cycle embedding in star graphs with more conditional faulty edges
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Optimal bounds for disjoint Hamilton cycles in star graphs
- Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
- Hyper Hamiltonian laceability on edge fault star graph
- Cycle embedding in star graphs with conditional edge faults
- Conditional fault Hamiltonicity of the complete graph
This page was built for publication: Conditional fault-tolerant Hamiltonicity of star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110556)
