17.8 THE CUT-SET MATRIX OF A LINEAR ORIENTED GRAPH
The branches connected between various nodes keep a graph connected. Removal of one or more judiciously selected branches can separate a connected graph into two connected subgraphs with no connection between them. The structural information of a graph can be given in terms of such sets of branches that will separate the graph into two connected subgraphs on their removal from the original graph.
Removal of a branch means that we will remove the branch; but leave the nodes intact. We may group the nodes into two sub-groups of nodes. Then, the graph will split into two connected subgraphs if we remove all the branches that are connected between one group of nodes and the second group of nodes. ...
Get Electric Circuits and Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
