Article ID Journal Published Year Pages File Type
4650244 Discrete Mathematics 2008 26 Pages PDF
Abstract

We find the minimal cutwidth and bisection width values for abelian Cayley graphs with up to 4 generators and present an algorithm for finding the corresponding optimal ordering. We also find minimal cuts of each order.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Minimal cutwidth linear arrangements of abelian Cayley graphs
Authors
, , ,