Edge disjoint paths in hypercubes and folded hypercubes with conditional faults

Yalin Qiao and Weihua Yang

Applied Mathematics and Computation, 2017, vol. 294, issue C, 96-101

Abstract: It is known that edge disjoint paths is closely related to the edge connectivity and the multicommodity flow problems. In this paper, we study the edge disjoint paths in hypercubes and folded hypercubes with edge faults. We first introduce the F-strongly Menger edge connectivity of a graph, and we show that in all n-dimensional hypercubes (folded hypercubes, respectively) with at most 2n−4(2n−2, respectively) edges removed, if each vertex has at least two fault-free adjacent vertices, then every pair of vertices u and v are connected by min{deg(u), deg(v)} edge disjoint paths, where deg(u) and deg(v) are the remaining degree of vertices u and v, respectively.

Keywords: Strong Menger edge connectivity; Hypercube; Folded hypercube; Conditional edge faults; Fault tolerance (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316305628
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:294:y:2017:i:c:p:96-101

DOI: 10.1016/j.amc.2016.09.002

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().