Iteration of the mincut graph operator

Abstract

A graph operator is a mapping $\ddot{I}•$ which maps every graph $G$ from some class of graphs to a new graph $\ddot{I}•(G)$. In this paper, we introduce and study the properties of the mincut operator, specifically the effects of iteration of the operator. We show that the property of being super edge-connected and regular is both necessary and sufficient for a graph to remain fixed under the mincut operator. Furthermore, we show that no graph diverges under iteration of this operator. We conclude by stating further research questions on the mincut operator.