Cycles in folded hypercubes with two adjacent faulty vertices

DOI10.1016/j.tcs.2019.05.038zbMath1434.68364OpenAlexW2955707851WikidataQ127566826 ScholiaQ127566826MaRDI QIDQ2330100

Che-Nan Kuo, Yu-Huei Cheng

Publication date: 18 October 2019

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

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

zbMATH Keywords

bipartitecyclegraph theoryinterconnection networksfolded hypercubes

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Fault-free cycles in folded hypercubes with more faulty elements
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network

This page was built for publication: Cycles in folded hypercubes with two adjacent faulty vertices