Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\)

DOI10.1016/j.tcs.2020.03.015zbMath1433.68061OpenAlexW3013113349MaRDI QIDQ1989359

Yu-Huei Cheng, Che-Nan Kuo

Publication date: 21 April 2020

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

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

zbMATH Keywords

cycleembeddinginterconnection 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)

Related Items (1)

Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs

Cites Work

• Unnamed Item
• Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
• Cycles embedding in folded hypercubes with conditionally faulty vertices
• Longest fault-free paths in hypercubes with vertex faults
• 1-vertex-fault-tolerant cycles embedding on folded hypercubes
• Fault-free cycles in folded hypercubes with more faulty elements
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
• Generalized Hypercube and Hyperbus Structures for a Computer Network

This page was built for publication: Fault-free cycles embedding in folded hypercubes with \(\mathrm{F}_4\)