ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Minimum cycle covers of Butterfly and Benes networks

Journal: International Journal of Mathematics and Soft Computing (Vol.2, No. 1)

Publication Date:

Authors : ;

Page : 93-98

Keywords : Benes networks; cycle partition; vertex-disjoint cycle cover; edge-disjoint cycle cover.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Butterfly network is the most popular bounded-degree derivative of the hypercube network. The benes network consists of back-to-back butterflies. In this paper, we obtain the minimum vertex-disjoint cycle cover number for the odd dimensional butterfly networks and prove that it is not possible to find the same for the even dimensional butterfly networks and benes networks. Further we obtain the minimum edge-disjoint cycle cover number for butterfly networks.

Last modified: 2013-08-24 01:57:23