Noun
cutwidth (plural cutwidths) (graph theory) The minimum number of edges that cross any cut between lower-numbered and higher-numbered vertices in an optimal linear arrangement of the vertices of a graph.