ON THE SOLVABILITY OF THE NULLATOR-NORATOR PAIRS NETWORK

Abstract

The paper deals with the unique solvability of a nullator-norator pairs network consisting of RLC elements and source generators. After defining the kernel of a network the normaL inverse normal, distinguished and reactance trees of the network graph are introduced. Setting out from [6] necessary and sufficient conditions are given for the unique solvability. A topological formula is introduced from which many sufficient conditions of the unique solvability can be obtained as algebraic equations between the parameters of the RLC network elements. The results of the paper are illustrated by examples. Finally. a block scheme is presented for the examination of the unique solvability by computer technique.