Fault-free longest paths in star networks with conditional link faults

DOI10.1016/j.tcs.2008.11.012zbMath1162.68004OpenAlexW2056214265MaRDI QIDQ1006049

Ping-Ying Tsai, Gen-Huey Chen, Jung-Sheng Fu

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.012

zbMATH Keywords

embeddingfault toleranceHamiltonian laceabilityconditional fault modelstar networkrandom fault model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (16)

The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Adaptive synchronization of bipartite dynamical networks with distributed delays and nonlinear derivative coupling ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Fault tolerance in \(k\)-ary \(n\)-cube networks ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ 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 ⋮ Survey on path and cycle embedding in some networks ⋮ Extra diagnosability and good-neighbor diagnosability of \(n\)-dimensional alternating group graph \(AG _n\) under the PMC model ⋮ Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyper Hamiltonian laceability on edge fault star graph
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Linear array and ring embeddings in conditional faulty hypercubes
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• A group-theoretic model for symmetric interconnection networks
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Fault tolerance measures for m-ary n-dimensional hypercubes based on forbidden faulty sets
• Hamiltonian-laceability of star graphs
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Efficient Gossiping by Packets in Networks with Random Faults
• Hamilton cycles and paths in butterfly graphs
• Near embeddings of hypercubes into Cayley graphs on the symmetric group
• Combinatorial analysis of the fault-diameter of the n-cube
• Longest fault-free paths in star graphs with vertex faults

This page was built for publication: Fault-free longest paths in star networks with conditional link faults