Back to Search
Start Over
Pancyclicity of Matching Composition Networks under the Conditional Fault Model.
- Source :
- IEEE Transactions on Computers; Feb2012, Vol. 61 Issue 2, p278-183, 0p
- Publication Year :
- 2012
-
Abstract
- A graph G=(V,E) is said to be \emph{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. \\ \noindent{\bf Keywords}: Conditional edge faults, fault-tolerant cycle embedding, matching composition networks, pancyclicity, multiprocessor systems. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00189340
- Volume :
- 61
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Computers
- Publication Type :
- Academic Journal
- Accession number :
- 70576272
- Full Text :
- https://doi.org/10.1109/TC.2010.229