Linearly Many Edge-Faults in 2-Bijective Connection Networks
Abstract
The class of 2-bijective connection networks (2BC networks) is defined recursively as follows: Let and for , let be the set of all graphs that can be constructed by taking two (possibly the same) elements and from (if we take the same element, we will assume they are two different copies and so remains empty) with two bijections and to form the graph where and such that . This class of networks includes the class of augmented cubes. We study the structural properties of the resulting graph when “many” edges are deleted from such a network. We then mention some applications.
Communicated by K. Qiu


