Graph theoretical properties of the node determinant of an LCR network
- 1 May 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 18 (3) , 343-350
- https://doi.org/10.1109/tct.1971.1083291
Abstract
The node determinant\Sigma A_{k} \Lambda^{k}of anLCRnetwork is given by the sum of the products of the element admittances of all the trees of the network. Some graph theoretical properties of the coefficients\{A_{k}\}are investigated where eachA_{k}is represented as a function of the element values. The main results include the theorem that any three successive coefficientsA_{k}, A_{k+1}, andA_{k+2}completely determine the network.Keywords
This publication has 4 references indexed in Scilit:
- On the Realization of Tree GraphsIEEE Transactions on Circuit Theory, 1968
- On Realizability of a Set of TreesIRE Transactions on Circuit Theory, 1961
- Graphs with two kinds of elementsJournal of the Franklin Institute, 1960
- On Coefficients of Polynomials in Network FunctionsIRE Transactions on Circuit Theory, 1960