Edge-bipancyclicity of star graphs with faulty elements

DOI10.1016/J.TCS.2011.09.006MaRDI QIDQ650935zbMATH OpenOpenAlexFDO

Authors Chao-Wen Huang, H.-L. Huang, Sun-Yuan Hsieh

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

zbMATH Keywords

Cayley graphsedge-bipancyclicityinterconnection networksstar graphsfault-tolerant embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Embedding cycles of various lengths into star graphs with both edge and vertex faults
• Cycle embedding in star graphs with edge faults
• Longest paths and cycles in faulty star graphs
• Cycle embedding in star graphs with more conditional faulty edges

Cites work

• scientific article; zbMATH DE number 3902696 (Why is no real title available?)
• scientific article; zbMATH DE number 54299 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• Cycle embedding in star graphs with edge faults
• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Embedding meshes on the star graph
• Hamiltonian-laceability of star graphs
• Hyper Hamiltonian laceability on edge fault star graph
• Longest fault-free paths in star graphs with vertex faults
• Longest paths and cycles in faulty star graphs
• Near embeddings of hypercubes into Cayley graphs on the symmetric group
• Pancyclic graphs. I
• Survey on path and cycle embedding in some networks

Cited in

(20)

• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Longest paths and cycles in faulty star graphs
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Longest fault-free paths in star graphs with vertex faults
• Cycle embedding in star graphs with more conditional faulty edges
• g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM^* model
• The largest component of faulty star graphs
• Cycle embedding in star graphs with conditional edge faults
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs
• Structure connectivity and substructure connectivity of star graphs
• The spanning laceability on the faulty bipartite hypercube-like networks
• Weak-vertex-pancyclicity of (\(n,k\))-star graphs
• Conditional edge-fault Hamiltonian-connectivity of restricted hypercube-like networks
• The \(h\)-extra connectivity and \(h\)-extra conditional diagnosability of bubble-sort star graphs
• Cycle embedding in star graphs with edge faults
• Embedding cycles of various lengths into star graphs with both edge and vertex faults
• Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
• Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks
• The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks

This page was built for publication: Edge-bipancyclicity of star graphs with faulty elements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650935)