Incompletely Partitioned Networks

A method is given for testing whether a graph G is an incompletely partitioned graph. The method is based on a simple criterion applied to the square of the adjacency matrix of the complement of Q. Further, a formula to determine the number of cut sets in such a graph is given, extending the previously available results for the number of cut sets in a graph. © 1967, Walter de Gruyter. All rights reserved.