Embedding longest fault-free paths onto star graphs with more vertex faults

DOI10.1016/j.tcs.2005.01.018zbMath1104.68085MaRDI QIDQ557839

Sun-Yuan Hsieh

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

zbMATH Keywords

hypercubes; fault-tolerant embedding; \(n\)-dimensional stars

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90B10: Deterministic network models in operations research

05C38: Paths and cycles

Related Items

Linearly many faults in arrangement graphs, Random induced subgraphs of Cayley graphs induced by transpositions, Cycle embedding in star graphs with more conditional faulty edges, The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks, Edge-bipancyclicity of star graphs with faulty elements, Conditional matching preclusion for the arrangement graphs, Fault tolerance in \(k\)-ary \(n\)-cube networks, Conditional connectivity of star graph networks under embedding restriction, Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults, Fault tolerance in bubble-sort graph networks, Cycle embedding in star graphs with conditional edge faults, On the construction of all shortest node-disjoint paths in star networks, Substar reliability analysis in star networks, 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, Fault-tolerant panconnectivity of augmented cubes, Survey on path and cycle embedding in some networks, Node-disjoint paths in a level block of generalized hierarchical completely connected networks, Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults, Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model, Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

Cites Work

• Unnamed Item
• 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
• Near embeddings of hypercubes into Cayley graphs on the symmetric group
• Longest fault-free paths in star graphs with vertex faults