Master cutset matrix

A systematic method of generation of all possible cutsets of a complete graph and of arranging them as a master cutset matrix is proposed, so that all possible cuts of any other graph with the same or smaller number of nodes may be obtained by simple modifications to it. Apart from the wide choice it provides in the selection of the cutsets for network studies, the enumeration of all cutsets plays a significant role in flow-network studies. A few properties of the master cutset matrix and its subclasses are discussed, including a formula for the number of cutsets in which a given set of edges appears, a recurrence relationship between the number of cutsets in different masters, and a procedure for determining the number of cutsets in an arbitrary graph. The methods discussed are also suitable for adaptation to computer.