Cutting numbers in graphs

The cutting number of a point of a connected graph is a measure of the extent to which the removal of that point cuts the graph. The cutting center of the graph is the set of points of maximal cutting number. In an earlier paper [1] all possible structures for the cutting center of a tree were determined and examples constructed which realize them. In this paper we extend those results to all graphs.