On Bandwidth, Cutwidth, and Quotient Graphs

@article{Barth1995OnBC,
  title={On Bandwidth, Cutwidth, and Quotient Graphs},
  author={Dominique Barth and François Pellegrini and Andr{\'e} Raspaud and Jean Roman},
  journal={ITA},
  year={1995},
  volume={29},
  pages={487-508}
}
The bandwidth and the cutwidth are fundamental parameters which can give indications on the complexity of many problems described in terms of graphs. In this paper, we present a method for nding general upper bounds for the bandwidth and the cutwidth of a given graph from those of any of its quotient graphs. Moreover, general lower bounds are obtained by using vertex-and edge-bisection notions. These results are used, in a second time, to study various interconnection networks: by choosing… CONTINUE READING