Accession Number : AD0285178

Title :   REALIZABILITY OF FUNDAMENTAL CUT-SET MATRICES OF ORIENTED GRAPHS

Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s) : MAYEDA,WATARU

Report Date : JUL 1962

Pagination or Media Count : 1

Abstract : As topology (linear graph theory) was r cognized to be a suitable tool to solve many problems in electrical networks, switching circuits communication nets, etc., the necessary nd sufficient conditio s that a matrix be a fundamental cutset (or circuit) matrix becomes one of the important problems in this field. If the problem is to find whether a given ma rix is a fundamental cut-set matrix of a non-oriented graph, there are four methods of testi g such a matrix at present. One of the e methods is mo ified suc that we can test whether a given matrix is a fundamental cut-set matrix of an orient d gr ph. (Author)

Descriptors :   *CONVEX SETS, *MATRICES(MATHEMATICS), *TOPOLOGY, COMMUNICATION SYSTEMS, ELECTRICAL NETWORKS, EXPERIMENTAL DATA, NETS, SEQUENCES(MATHEMATICS), TABLES(DATA)

Distribution Statement : APPROVED FOR PUBLIC RELEASE