Cycle embedding in star graphs with more conditional faulty edges

DOI10.1016/j.amc.2011.09.033zbMath1242.05151OpenAlexW2023631138MaRDI QIDQ426437

Dongqin Cheng, Dachang Guo

Publication date: 11 June 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.09.033

zbMATH Keywords

interconnection networkstar graphfault tolerantcycle embeddingconditional faulty edges

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Two node-disjoint paths in balanced hypercubes ⋮ Conditional edge-fault pancyclicity of augmented cubes ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Odd cycles embedding on folded hypercubes with conditional faulty edges ⋮ Vertex-fault-tolerant cycles embedding in balanced hypercubes ⋮ Structure connectivity and substructure connectivity of star graphs

Cites Work

• Embedding longest fault-free paths onto star graphs with more vertex faults
• Hyper Hamiltonian laceability on edge fault star graph
• Cycle embedding in star graphs with conditional edge faults
• Path embedding in star graphs
• Embedding meshes on the star graph
• Cycle embedding in star graphs with edge faults
• 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

This page was built for publication: Cycle embedding in star graphs with more conditional faulty edges