Pancyclicity of matching composition networks under the conditional fault model

Chia Wei Lee, Sun-Yuan Hsieh

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


A graph G = (V,E) is said to be conditional k-edge-fault pancyclic if, after removing k faulty edges from G and provided that each node is incident to at least two fault-free edges, the resulting graph contains a cycle of every length from its girth to |V| inclusive. In this paper, we sketch the common properties of a class of networks called Matching Composition Networks (MCNs), such that the conditional edge-fault pancyclicity of MCNs can be determined from the derived properties. We then apply our technical theorem to show that an m-dimensional hyper-Petersen network is conditional (2m-5)-edge-fault pancyclic.

Original languageEnglish
Article number5645616
Pages (from-to)278-283
Number of pages6
JournalIEEE Transactions on Computers
Issue number2
Publication statusPublished - 2012 Jan 10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Pancyclicity of matching composition networks under the conditional fault model'. Together they form a unique fingerprint.

Cite this