Bounds on Mincut for Cayley Graphs over Abelian Groups
In this paper we find upper bounds for the mincut value of Cayley graphs over abelian groups. These results provide a significant improvement of those in Annextein and Baumslag (Math. Syst. Theory 26(3):271-291, [1993]).
bounds mincut cayley graphs graph theory bisection algorithms combinatorial optimization