DocumentCode :
1168835
Title :
Decomposition of a graph into compactly connected two-terminal subgraphs
Author :
Ariyoshi, Hiromu ; Shirakawa, Isao ; Ozaki, Hiroshi
Volume :
18
Issue :
4
fYear :
1971
fDate :
7/1/1971 12:00:00 AM
Firstpage :
430
Lastpage :
435
Abstract :
In the process of calculating the admittance matrix of a fairly large 
-port network of 
nodes, we are often confronted with the problem of seeking that order of the pivotal condensations with respect to 
internal ports of the primitive admittance matrix. Motivated by this problem, we discuss a method of decomposing a given graph.into "compactly connected" two-terminal subgraphs. The decomposition enables us to apply the block-pivoted condensation on the nodal admittance matrix.
-port network of nodes, we are often confronted with the problem of seeking that order of the pivotal condensations with respect to internal ports of the primitive admittance matrix. Motivated by this problem, we discuss a method of decomposing a given graph.into "compactly connected" two-terminal subgraphs. The decomposition enables us to apply the block-pivoted condensation on the nodal admittance matrix.Keywords :
Graph theory; Network analysis; Network topology; Admittance; Bismuth; Frequency; Helium; Matrix decomposition;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1971.1083313
Filename :
1083313
Link To Document :
