Abstract
The usual definition of a cut-set in graph theory is extended to include both vertices and branches as its elements.This generalized cut-set is then classified in three categories.Properties of the three different classes are found and the relationship among them established.The effects of the generalized cut-set on dual graphs are also studied.A simple method of generating all basic cut-sets with respect to a pair of vertices is obtained.
Original language | English (US) |
---|---|
Pages (from-to) | 31-48 |
Number of pages | 18 |
Journal | Journal of the Franklin Institute |
Volume | 273 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1962 |
Externally published | Yes |
ASJC Scopus subject areas
- Control and Systems Engineering
- Signal Processing
- Computer Networks and Communications
- Applied Mathematics