![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
ABSTRACT
The method of determining all the possible cut sets of a graph by the linear combination of the rows of the incident matrix of the graph is examined. The conditions to be satisfied for such combinations to yield cut sets are determined. The maximum number of branches that would constitute a cut set of a graph is found out.