Minimum cycle covers of Butterfly and Benes networks
Journal: International Journal of Mathematics and Soft Computing (Vol.2, No. 1)Publication Date: 2012-01-29
Authors : Albert William A. Shanthakumari;
Page : 93-98
Keywords : Benes networks; cycle partition; vertex-disjoint cycle cover; edge-disjoint cycle cover.;
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.
Other Latest Articles
- Harvesting and Hopf Bifurcation in a prey-predator model with Holling Type IV Functional Response
- On edge irregularity strength of subdivision of star Sn
- d-ideals and injective ideals in a distributive lattice
- Multi-level distance labelings for generalized gear graphs
- Secondary orthogonal similarity of a real matrix and its secondary transpose
Last modified: 2013-08-24 01:57:23