Embedding longest fault-free paths onto star graphs with more vertex faults
From MaRDI portal
Publication:557839
DOI10.1016/J.TCS.2005.01.018zbMath1104.68085OpenAlexW2013044245MaRDI QIDQ557839
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.01.018
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38)
Related Items (31)
The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model ⋮ Cycle embedding in star graphs with conditional edge faults ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ Linearly many faults in arrangement graphs ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Path and cycle fault tolerance of bubble-sort graph networks ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ The spanning cyclability of Cayley graphs generated by transposition trees ⋮ On the construction of all shortest node-disjoint paths in star networks ⋮ Cycle embedding in star graphs with more conditional faulty edges ⋮ Structure connectivity and substructure connectivity of wheel networks ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Substar reliability analysis in star networks ⋮ Conditional matching preclusion for the arrangement graphs ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Properties of a hierarchical network based on the star graph ⋮ Embedding cycles of various lengths into star graphs with both edge and vertex faults ⋮ Pancyclicity and bipancyclicity of conditional faulty folded hypercubes ⋮ Structure connectivity and substructure connectivity of bubble-sort star graph networks ⋮ Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults ⋮ Fault tolerance in bubble-sort graph networks ⋮ Fault-tolerant panconnectivity of augmented cubes ⋮ The preclusion numbers and edge preclusion numbers in a class of Cayley graphs ⋮ Structure connectivity and substructure connectivity of star graphs ⋮ Survey on path and cycle embedding in some networks
Cites Work
- Unnamed Item
- Unnamed Item
- Embedding meshes on the star graph
- A group-theoretic model for symmetric interconnection networks
- Embedding an arbitrary binary tree into the star graph
- Hamiltonian-laceability of star graphs
- Near embeddings of hypercubes into Cayley graphs on the symmetric group
- Longest fault-free paths in star graphs with vertex faults
This page was built for publication: Embedding longest fault-free paths onto star graphs with more vertex faults
