Back to Search
Start Over
Cut-set graph and systematic generation of separating sets
- Source :
- IEEE Transactions on Circuit Theory. 19:233-240
- Publication Year :
- 1972
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 1972.
-
Abstract
- In this paper an efficient method of generating separating sets of a given graph with the use of a newly defined concept-a cutset graph-is discussed. The cut-set graph of a given graph G is defined such that each edge of the graph corresponds to a pair of basic branch cut-sets of G having the relation that the ring sum of these cut-sets coincides with an incident cut-set with respect to a vertex in G . The present paper shows that the cut-set graph is a useful tool for solution of the problem of generating all of the basic vertex cut-sets and the basic mixed cut-sets of a given graph.
Details
- ISSN :
- 00189324
- Volume :
- 19
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Circuit Theory
- Accession number :
- edsair.doi...........9797ba7a4d99dbbb911682a6bb81a454