DocumentCode :
1168630
Title :
Graph theoretical properties of the node determinant of an LCR network
Author :
Kajitani, Yoji
Volume :
18
Issue :
3
fYear :
1971
fDate :
5/1/1971 12:00:00 AM
Firstpage :
343
Lastpage :
350
Abstract :
The node determinant \\Sigma A_{k} \\Lambda ^{k} of an LCR network 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 each A_{k} is represented as a function of the element values. The main results include the theorem that any three successive coefficients A_{k}, A_{k+1} , and A_{k+2} completely determine the network.
Keywords :
Network topology; Admittance; Artificial intelligence; Capacitors; Conductors; Frequency; Helium; Inductors; Network theory (graphs); Network topology; Tree graphs;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1971.1083291
Filename :
1083291
Link To Document :
بازگشت