Unpaired Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks
Jung-Heum Park · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2006
An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, , with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any .