![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
ABSTRACT
The class of short circuit conductance matrices realizable as n-port resistive networks is extended in this paper using generalized tree terminal graphs. In Part I, the realization is done in terms of PL tree terminal graphs. Necessary and sufficient conditions are given so that the tree terminal graph corresponding to a given short circuit conductance matrix is a PL tree. These conditions are based entirely on the sign pattern of the entries of the short circuit conductance matrix. Also the necessary and sufficient conditions for the realizability are stated.
In Part II, the general question of realizability, determination of an appropriate tree terminal graph and the complete realization of a short circuit conductance matrix are discussed. No tree transformations are used in the realization procedure.