Longest fault-free paths in star graphs with vertex faults
From MaRDI portal
Publication:5958120
DOI10.1016/S0304-3975(00)00190-0zbMath0983.68141OpenAlexW1990269643MaRDI QIDQ5958120
No author found.
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00190-0
bipartite graphCayley graphHamiltonian pathfault-tolerant embeddinggraph-theoretic interconnection networklongest pathstar graph
Related Items (39)
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Cycle embedding in star graphs with conditional edge faults ⋮ Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Edge-disjoint paths in faulty augmented cubes ⋮ Linearly many faults in arrangement graphs ⋮ The largest component of faulty star graphs ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Matroidal connectivity and conditional matroidal connectivity of star graphs ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ Cycle embedding in star graphs with more conditional faulty edges ⋮ Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Torus-like graphs and their paired many-to-many disjoint path covers ⋮ Substar reliability analysis in star networks ⋮ Conditional matching preclusion for the arrangement graphs ⋮ Largest connected component of a star graph with faulty vertices ⋮ Hamiltonian cycles and paths in faulty twisted hypercubes ⋮ The 4-component connectivity of alternating group networks ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ Many-to-many disjoint paths in hypercubes with faulty vertices ⋮ Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity ⋮ Embedding longest fault-free paths onto star graphs with more vertex faults ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Embedding cycles of various lengths into star graphs with both edge and vertex faults ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ Path embedding in star graphs ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ Fault-tolerant panconnectivity of augmented cubes ⋮ Structure connectivity and substructure connectivity of star graphs ⋮ Survey on path and cycle embedding in some networks ⋮ Cycle embedding in star graphs with edge faults
Cites Work
- Unnamed Item
- Unnamed Item
- Embedding meshes on the star graph
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- A group-theoretic model for symmetric interconnection networks
- Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
- Embedding an arbitrary binary tree into the star graph
- Efficient Gossiping by Packets in Networks with Random Faults
- Near embeddings of hypercubes into Cayley graphs on the symmetric group
This page was built for publication: Longest fault-free paths in star graphs with vertex faults
