Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Institution of Electrical Engineers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
