Accession Number : AD0647833

Title :   ELIMINATION OF SUBGRAPHS IN A SIGNAL FLOW GRAPH,

Corporate Author : ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB

Personal Author(s) : Mayeda,W.

Report Date : FEB 1967

Pagination or Media Count : 20

Abstract : The node elimination of a signal flow graph is a well-known technique. However when one uses the technique of eliminating nodes one by one, it is natural to investigate the possibility of finding a technique of eliminating a set of nodes at once which may be simpler than eliminating these nodes one by one depending on the topology of a given signal flow graph. Here a method of eliminating a subgraph which is obviously equivalent to eliminating a set of nodes at once is introduced. One of the two formulas used to accomplish this elimination is the same form as the other can be considered as the modification of the Mason's formula. Furthermore the special case of this formula becomes obviously identical to the node elimination formula. (Author)

Descriptors :   (*TOPOLOGY, *ELECTRICAL NETWORKS), GRAPHICS, TRANSFORMATIONS(MATHEMATICS), MATRICES(MATHEMATICS), INFORMATION THEORY

Subject Categories : Electrical and Electronic Equipment
      Theoretical Mathematics
      Cybernetics

Distribution Statement : APPROVED FOR PUBLIC RELEASE