REALIZABILITY OF FUNDAMENTAL CUT-SET MATRICES OF ORIENTED GRAPHS

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)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1962
Accession Number
AD0285178

Entities

People

  • Wataru Mayeda

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Circuits
  • Electrical Networks
  • Graph Theory
  • Mathematics
  • Networks
  • Switching
  • Switching Circuits
  • Topology

Readers

  • Linear Algebra
  • Snow Cover Descriptors for Reptiles and Their Illustrations.
  • Systems Analysis and Design