Longest paths and cycles in faulty star graphs
From MaRDI portal
Publication:705576
DOI10.1016/J.JPDC.2004.08.004zbMATH Open1060.05058OpenAlexW2069397966MaRDI QIDQ705576FDOQ705576
Authors: Jung-Heum Park, Hee-Chul Kim 
Publication date: 31 January 2005
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.08.004
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
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)
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)
