## On bounding the bandwidth of graphs with symmetry

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the well-known semidenite programming relaxation for the quadratic assignment problem by fixing two vertices in the … Read more