On excessive index of certain networks

Authors:
Indra Rajasingh;R. Bharati;Albert Muthumalai;A. S. Shanthi
Affiliations:
School of Advanced Sciences, VIT University, Chennai 600 127, India;Department of Mathematics, Loyola College, Chennai 600 034, India;Department of Mathematics, Loyola College, Chennai 600 034, India;Department of Mathematics, Loyola College, Chennai 600 034, India
Venue:
Theoretical Computer Science
Year:
2013

Citing 9
Cited 0

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Honeycomb Networks: Topological Properties and Communication Algorithms

IEEE Transactions on Parallel and Distributed Systems
An efficient representation of Benes networks and its applications

Journal of Discrete Algorithms
On minimum sets of 1-factors covering a complete multipartite graph

Journal of Graph Theory
Scheduling for Parallel Processing

Scheduling for Parallel Processing
1-factor covers of regular graphs

Discrete Applied Mathematics
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength

Discrete Applied Mathematics
The equivalence of two conjectures of Berge and Fulkerson

Journal of Graph Theory
Enhanced-Star: a new topology based on the star graph

ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	5.23

Visualization

Abstract

Matching is one of the most extensively studied areas in Computer Science and is interesting from the combinatorial point of view as well. A matching in a graph G=(V,E) is a subset M of edges, no two of which have a vertex in common. A matching M is said to be perfect if every vertex in G is an endpoint of one of the edges in M. The excessive index of a graph G is the minimum number of perfect matchings to cover the edge set of G. The study of excessive index has a number of applications particularly in scheduling theory. In this paper we determine the excessive index for certain classes of graphs including augmented butterfly network and honeycomb network. We also prove that the excessive index does not exist for butterfly and Benes networks.