Paired Many-to-Many Disjoint Path Covers in Recursive Circulants and Tori
Eu-Sang Kim, Jung-Heum Park · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2009
A paired many-to-many k-disjoint path cover (paired k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants G(,d) with and tori, and show that provided the number of faulty elements (vertices and/or edges) is f or less, every nonbipartite recursive circulant and torus of degree has a paired k-DPC for any f and with .