Hyper Hamiltonian laceability on edge fault star graph
From MaRDI portal
Publication:707305
DOI10.1016/j.ins.2003.09.023zbMath1057.05054OpenAlexW2009616880MaRDI QIDQ707305
Tseng-Kuei Li, Lih-Hsing Hsu, Jimmy J. M. Tan
Publication date: 9 February 2005
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2003.09.023
star graphHamiltonian laceablefault tolerant.hyper Hamiltonian lacebalestrongly Hamiltonian laceable
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)
Related Items (47)
Longest fault-free paths in hypercubes with vertex faults ⋮ On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ Hamilton paths and cycles in varietal hypercube networks with mixed faults ⋮ The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs ⋮ Embedding meshes into crossed cubes ⋮ A study of fault tolerance in star graph ⋮ Cycle embedding in star graphs with conditional edge faults ⋮ Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ Node-disjoint paths in hierarchical hypercube networks ⋮ Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions ⋮ Edge-bipancyclicity of star graphs under edge-fault tolerant ⋮ A comparative study of job allocation and migration in the pancake network ⋮ Hamiltonian laceability of bubble-sort graphs with edge faults ⋮ Strong matching preclusion for augmented cubes ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Random induced subgraphs of Cayley graphs induced by transpositions ⋮ Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges ⋮ Cycle embedding in star graphs with more conditional faulty edges ⋮ Matching preclusion and conditional matching preclusion for regular interconnection networks ⋮ Diagnosability of star graphs with missing edges ⋮ Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Substar reliability analysis in star networks ⋮ Fault-free mutually independent Hamiltonian cycles of faulty star graphs ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ The \(m\)-pancycle-connectivity of a WK-recursive network ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ Robustness of star graph network under link failure ⋮ Measuring the impact of MVC attack in large complex networks ⋮ Edge-fault-tolerant pancyclicity of arrangement graphs ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Fault-tolerant edge-pancyclicity of locally twisted cubes ⋮ Distance formula and shortest paths for the \((n,k)\)-star graphs ⋮ The super connectivity of the pancake graphs and the super laceability of the star graphs ⋮ Improving bounds on link failure tolerance of the star graph ⋮ Properties of a hierarchical network based on the star graph ⋮ Conditional fault hamiltonian connectivity of the complete graph ⋮ Embedding cycles of various lengths into star graphs with both edge and vertex faults ⋮ Fault-free longest paths in star networks with conditional link faults ⋮ Hamiltonian connectivity of 2-tree-generated networks ⋮ Embedding Hamiltonian cycles in alternating group graphs under conditional fault model ⋮ Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks ⋮ Structure connectivity and substructure connectivity of star graphs ⋮ Survey on path and cycle embedding in some networks ⋮ Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs ⋮ On the extremal number of edges in Hamiltonian connected graphs ⋮ Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
Cites Work
- Unnamed Item
- Unnamed Item
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- A group-theoretic model for symmetric interconnection networks
- Embedding an arbitrary binary tree into the star graph
- Hamiltonian-laceability of star graphs
- Hamilton cycles and paths in butterfly graphs
- Near embeddings of hypercubes into Cayley graphs on the symmetric group
This page was built for publication: Hyper Hamiltonian laceability on edge fault star graph
