Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults

• Published in: Theoretical computer science Vol. 602; pp. 125 - 131
• Main Author: Kuo, Che-Nan
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 18.10.2015
• Subjects: Bipancyclicity; Computer simulation; Fault-free; Fault-tolerant; Faults; Folded hypercubes; Graph theory; Graphs; Hypercubes; Interconnection networks; Mathematical models; Networks; Pancyclicity; Topology; Pancyclicity; Folded hypercubes; Bipancyclicity; Fault-tolerant; Interconnection networks; Fault-free

A graph is said to be pancyclic if it contains cycles of every length from its girth to its order inclusive; and a bipartite graph is said to be bipancyclic if it contains cycles of every even length from its girth to its order. The pancyclicity or the bipancyclicity of a given network is an importa...