Longest paths and cycles in faulty star graphs
From MaRDI portal
(Redirected from Publication:705576)
Recommendations
- Longest fault-free paths in star graphs with vertex faults
- Cycle embedding in star graphs with conditional edge faults
- Edge-bipancyclicity of star graphs with faulty elements
- Embedding cycles of various lengths into star graphs with both edge and vertex faults
- Embedding longest fault-free paths onto star graphs with more vertex faults
Cited in
(12)- Fault-free mutually independent Hamiltonian cycles of faulty star graphs
- Paired many-to-many disjoint path covers in faulty hypercubes
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Longest fault-free paths in star graphs with vertex faults
- The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
- Embedding longest fault-free paths in arrangement graphs with faulty vertices
- The largest component of faulty star graphs
- Fault-free longest paths in star networks with conditional link faults
- On the construction of all shortest node-disjoint paths in star networks
- Embedding cycles of various lengths into star graphs with both edge and vertex faults
- Edge-bipancyclicity of star graphs with faulty elements
- Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
This page was built for publication: Longest paths and cycles in faulty star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705576)
