Title :
Algebraic determination of all vertex cutsets in a graph
Author_Institution :
University of Notre Dame, Department of Electrical Engineering, Notre Dame, USA
fDate :
4/1/1969 12:00:00 AM
Abstract :
Algebraic operations which apply to cutsets are defined. Their application to the expansion of certain product sums of the vertexes, contained in the nonredundant paths in an arbitrary graph, leads directly to the unique identification of each and every vertex cutset, with respect to any given pair of vertexes in the graph. This information is essential to the analysis of flow and reliability in communication nets. The cutsetgeneration technique is algebraically efficient and practicable.
Keywords :
communication networks; graph theory; network topology;
Journal_Title :
Electrical Engineers, Proceedings of the Institution of
DOI :
10.1049/piee.1969.0104
