Edge-bipancyclicity of star graphs with faulty elements
From MaRDI portal
Publication:650935
DOI10.1016/j.tcs.2011.09.006zbMath1230.68159MaRDI QIDQ650935
Sun-Yuan Hsieh, Chao-Wen Huang, Hui-Ling Huang
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.006
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks, The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks, Structure connectivity and substructure connectivity of star graphs, 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, Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks, The spanning laceability on the faulty bipartite hypercube-like networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Longest paths and cycles in faulty star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Survey on path and cycle embedding in some networks
- Embedding meshes on the star graph
- Pancyclic graphs. I
- Cycle embedding in star graphs with edge faults
- A group-theoretic model for symmetric interconnection networks
- 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
